Improving binding times without explicit CPS-conversion
- 1 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Lisp Pointers
- Vol. V (1), 1-10
- https://doi.org/10.1145/141478.141483
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Generating a compiler for a lazy language by partial evaluationPublished by Association for Computing Machinery (ACM) ,1992
- Automatic autoprojection of recursive equations with global variables and abstract data typesScience of Computer Programming, 1991
- Compiling inheritance using partial evaluationACM SIGPLAN Notices, 1991
- Semantics-directed compilation of nonlinear patternsInformation Processing Letters, 1991
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991
- Partial evaluation is fuller lazinessPublished by Association for Computing Machinery (ACM) ,1991
- Binding time analysis for high order untyped functional languagesPublished by Association for Computing Machinery (ACM) ,1990
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Automatic binding time analysis for a typed λ-calculusPublished by Association for Computing Machinery (ACM) ,1988