Functional completeness of the mixed -calculus and combinatory logic

DOI10.1016/0304-3975(90)90155-BzbMATH Open0714.03014OpenAlexW2138472690MaRDI QIDQ750415FDOQ750415

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4002064
• scientific article; zbMATH DE number 4045707
• On combinatory complete sets of proper combinators
• THE QUINE-BERNAYS COMBINATORY CALCULUS
• Categorical combinators

zbMATH Keywords

combinatory logiccompletenesslambda calculus

Mathematics Subject Classification ID

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

Cites Work

• A new implementation technique for applicative languages
• Title not available (Why is that?)
• Strictness analysis and denotational abstract interpretation
• Automatic binding time analysis for a typed \(\lambda\)-calculus
• Another algorithm for bracket abstraction

Cited In (8)

• L-Completeness of the Lambek Calculus with the Reversal Operation
• On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
• Title not available (Why is that?)
• Functional completeness in iterative meta-algebras
• Completeness of transfinite evaluation in an extension of the lambda calculus
• Title not available (Why is that?)
• Two-Level Functional Languages
• Using transformations in the implementation of higher-order functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750415)