Binding time analysis
- 1 May 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (9) , 154-165
- https://doi.org/10.1145/115866.115881
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A relational approach to strictness analysis for higher-order polymorphic functionsPublished by Association for Computing Machinery (ACM) ,1991
- Abstract Interpretation, Logical Relations, and Kan ExtensionsJournal of Logic and Computation, 1990
- Binding time analysis for high order untyped functional languagesPublished by Association for Computing Machinery (ACM) ,1990
- Two-level semantics and abstract interpretationTheoretical Computer Science, 1989
- Transformations on higher-order functionsPublished by Association for Computing Machinery (ACM) ,1989
- Computer-time garbage collection by sharing analysisPublished by Association for Computing Machinery (ACM) ,1989
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988