On the rôle of minimal typing derivations in type-driven program transformation

Authors:
Stefan Holdermans;Jurriaan Hage
Affiliations:
Vector Fabrics, Paradijslaan, KN Eindhoven, The Netherlands;Utrecht University, TB Utrecht, The Netherlands
Venue:
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Year:
2010

Citing 19
Cited 1

Extracting &ohgr;'s programs from proofs in the calculus of constructions

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic parallelization of lazy functional programs

ESOP'92 Symposium proceedings on 4th European symposium on programming
Once upon a type

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
What are principal typings and what are they good for?

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modular, polyvariant and type-based closure analysis

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Inference of polymorphic and conditional strictness properties

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Once upon a polymorphic type

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principality and decidable type inference for finite-rank intersection types

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Type-based useless variable elimination

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
The Definition of Standard ML

The Definition of Standard ML
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-Based Useless-Code Elimination for Functional Programs

SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Detecting and Removing Dead-Code using Rank 2 Intersection

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Minimal Thunkification

WSA '93 Proceedings of the Third International Workshop on Static Analysis
Modular control-flow analysis with rank 2 intersection types

Mathematical Structures in Computer Science
A conjunctive type system for useless-code elimination

Mathematical Structures in Computer Science
Automatic useless-code elimination for HOT functional programs

Journal of Functional Programming
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)

Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Standard inference algorithms for type systems involving ML-style polymorphism aim at reconstructing most general types for all let-bound identifiers. Using such algorithms to implement modular program optimisations by means of type-driven transformation techniques generally yields suboptimal results. We demonstrate how this defect can be made up for by using algorithms that target at obtaining so-called minimal typing derivations instead. The resulting approach retains modularity and is applicable to a large class of polyvariant program transformations.