Functional back-ends within the lambda-sigma calculus
- 15 June 1996
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 31 (6) , 25-33
- https://doi.org/10.1145/232627.232632
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Confluence properties of weak and strong calculi of explicit substitutionsJournal of the ACM, 1996
- A call-by-need lambda calculusPublished by Association for Computing Machinery (ACM) ,1995
- A natural semantics for lazy evaluationPublished by Association for Computing Machinery (ACM) ,1993
- From operational semantics to abstract machinesMathematical Structures in Computer Science, 1992
- A categorical understanding of environment machinesJournal of Functional Programming, 1992
- An abstract framework for environment machinesTheoretical Computer Science, 1991
- A compiler for lazy MLPublished by Association for Computing Machinery (ACM) ,1984
- Compiling a functional languagePublished by Association for Computing Machinery (ACM) ,1984
- LCF considered as a programming languageTheoretical Computer Science, 1977
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964