Functional completeness of the mixed λ-calculus and combinatory logic
- 15 January 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 70 (1) , 99-126
- https://doi.org/10.1016/0304-3975(90)90155-b
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988
- Strictness analysis and denotational abstract interpretationInformation and Computation, 1988
- Another algorithm for bracket abstractionThe Journal of Symbolic Logic, 1979
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979