Automatic autoprojection of higher order recursive equations
- 31 December 1991
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 17 (1-3) , 3-34
- https://doi.org/10.1016/0167-6423(91)90035-v
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A self-applicable partial evaluator for the lambda calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Automatic autoprojection of recursive equations with global variables and abstract data typesScience of Computer Programming, 1991
- Binding time analysis for high order untyped functional languagesPublished by Association for Computing Machinery (ACM) ,1990
- Partial type inference for untyped functional programsPublished by Association for Computing Machinery (ACM) ,1990
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Partial evaluation of pattern matching in stringsInformation Processing Letters, 1989
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- The concept of a supercompilerACM Transactions on Programming Languages and Systems, 1986
- Polyvariant mixed computation for analyzer programsActa Informatica, 1984
- On the partial computation principleInformation Processing Letters, 1977