Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic

DOI10.1016/0304-3975(90)90155-BzbMath0714.03014OpenAlexW2138472690MaRDI QIDQ750415

Hanne Riis Nielson, Flemming Nielson

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90155-b

zbMATH Keywords

completenesslambda calculuscombinatory logic

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Using transformations in the implementation of higher-order functions

Cites Work

• Unnamed Item
• Strictness analysis and denotational abstract interpretation
• Automatic binding time analysis for a typed \(\lambda\)-calculus
• A new implementation technique for applicative languages
• Another algorithm for bracket abstraction

This page was built for publication: Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic