Automatic binding time analysis for a typed λ-calculus
- 8 April 1988
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 10 (2) , 139-176
- https://doi.org/10.1016/0167-6423(88)90025-1
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Two-level semantics and code generationTheoretical Computer Science, 1988
- Strictness analysis and denotational abstract interpretationInformation and Computation, 1988
- Code generation from two-level denotational meta-languagesPublished by Springer Nature ,1986
- Correctness of code generation from a two-level meta-languagePublished by Springer Nature ,1986
- Pragmatic aspects of two-level denotational meta-languagesPublished by Springer Nature ,1986
- Abstract interpretation of denotational definitionsPublished by Springer Nature ,1985
- Miranda: A non-strict functional language with polymorphic typesLecture Notes in Computer Science, 1985
- Denotational semantics: The scott-strachey approach to programming language theory: Joseph E. Stoy (The MIT Press, Cambridge, MA)Computer Languages, 1983
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978