The essence of eta-expansion in partial evaluation
- 1 September 1995
- journal article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 8 (3) , 209-227
- https://doi.org/10.1007/bf01019004
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Continuation-based partial evaluationPublished by Association for Computing Machinery (ACM) ,1994
- Compiling actions by partial evaluationPublished by Association for Computing Machinery (ACM) ,1993
- A tour of SchismPublished by Association for Computing Machinery (ACM) ,1993
- Polyvariant binding-time analysis for applicative languagesPublished by Association for Computing Machinery (ACM) ,1993
- Tutorial notes on partial evaluationPublished by Association for Computing Machinery (ACM) ,1993
- Representing Control: a Study of the CPS TransformationMathematical Structures in Computer Science, 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
- Automatic autoprojection of recursive equations with global variables and abstract data typesScience of Computer Programming, 1991
- For a better support of static data flowPublished by Springer Nature ,1991