On the Rôle of Minimal Typing Derivations in Type-driven Program Transformation

Stefan Holdermans, Jurriaan Hage

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationProceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Subtitle of host publicationLDTA '10
PublisherAssociation for Computing Machinery
ISBN (Print)9781450300636
DOIs
Publication statusPublished - 28 Mar 2010

Fingerprint

Dive into the research topics of 'On the Rôle of Minimal Typing Derivations in Type-driven Program Transformation'. Together they form a unique fingerprint.

Cite this