scientific article; zbMATH DE number 4045707

zbMATH Open0642.03006MaRDI QIDQ3783263FDOQ3783263

Authors: Sachio Hirokawa 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
• Lambda terms definable as combinators
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• Abstraction problems in combinatory logic: A compositive approach
• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.

zbMATH Keywords

combinatory logicreductionlambda calculusBCK-lambda terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (16)

• Weak consequence relation between \(\lambda\)-terms
• On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
• Preface
• Applications of Plotkin-terms: partitions and morphisms for closed terms
• Title not available (Why is that?)
• A direct proof of the finite developments theorem
• The basis decision problem in λ‐calculus
• Finite generation and presentation problems for lambda calculus and combinatory logic
• Title not available (Why is that?)
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
• The systematic construction of a one-combinator basis for lambda-terms
• Title not available (Why is that?)
• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• Abstraction problems in combinatory logic: A compositive approach
• Sequent combinators: a Hilbert system for the lambda calculus

This page was built for publication:

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