Type specialisation for the λ-calculus; or, a new paradigm for partial evaluation based on type inference
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 183-215
- https://doi.org/10.1007/3-540-61580-6_10
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Type-directed partial evaluationPublished by Association for Computing Machinery (ACM) ,1996
- Polyvariant constructor specialisationPublished by Association for Computing Machinery (ACM) ,1995
- Two-Level Functional LanguagesPublished by Cambridge University Press (CUP) ,1992
- The essence of functional programmingPublished by Association for Computing Machinery (ACM) ,1992
- Improving binding times without explicit CPS-conversionPublished by Association for Computing Machinery (ACM) ,1992
- Automatic autoprojection of higher order recursive equationsScience of Computer Programming, 1991
- Efficient type inference for higher-order binding-time analysisPublished by Springer Nature ,1991
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991
- Functional Programming Languages and Computer ArchitecturePublished by Springer Nature ,1991
- Projection Factorisations in Partial EvaluationPublished by Cambridge University Press (CUP) ,1991