A semantic model of binding times for safe partial evaluation
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 299-320
- https://doi.org/10.1007/bfb0026827
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Polyvariant binding-time analysis for applicative languagesPublished by Association for Computing Machinery (ACM) ,1993
- Minimal thunkificationPublished by Springer Nature ,1993
- A self-applicable partial evaluator for the lambda calculusACM Transactions on Programming Languages and Systems, 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
- Binding time analysisACM SIGPLAN Notices, 1991
- Program bifurcation for a polymorphically typed functional languagePublished by Association for Computing Machinery (ACM) ,1991
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991
- Binding time analysis for polymorphically typed higher order languagesPublished by Springer Nature ,1989
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979