Binding time analysis for high order untyped functional languages
- 1 May 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 264-272
- https://doi.org/10.1145/91556.91668
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Transformations on higher-order functionsPublished by Association for Computing Machinery (ACM) ,1989
- Binding time analysis for polymorphically typed higher order languagesPublished by Springer Nature ,1989
- Replacing function parameters by global variablesPublished by Association for Computing Machinery (ACM) ,1989
- Automatic binding time analysis for a typed λ-calculusPublished by Association for Computing Machinery (ACM) ,1988
- A collecting interpretation of expressionsPublished by Association for Computing Machinery (ACM) ,1988
- New insights into partial evaluation: the SCHISM experimentPublished by Springer Nature ,1988
- Correct flow analysis in continuation semanticsPublished by Association for Computing Machinery (ACM) ,1988
- Higher-order strictness analysis in untyped lambda calculusPublished by Association for Computing Machinery (ACM) ,1986
- A flexible approach to interprocedural data flow analysis and programs with recursive data structuresPublished by Association for Computing Machinery (ACM) ,1982