Lambda terms definable as combinators

DOI10.1016/S0304-3975(96)00111-9MaRDI QIDQ1349878zbMATH OpenFDO

Authors Martin W. Bunder

Publication date 27 February 1997

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

zbMATH Keywords

implicational logicscombinatorsnatural deduction systemscombinatory termHilbert-style systemslambda terms

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 2185659
• The systematic construction of a one-combinator basis for lambda-terms
• scientific article; zbMATH DE number 733165
• scientific article; zbMATH DE number 5318491
• \(\lambda\)-definability and recursiveness
• scientific article; zbMATH DE number 176159
• Combinatorics of \(\lambda\)-terms: a natural approach
• Lambda terms for natural deduction, sequent calculus and cut elimination
• scientific article; zbMATH DE number 3993540

Cites work

• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• Intersection types for combinatory logic
• The proofs of α → α in P – W

Cited in

(7)

• Ticket Entailment is decidable
• scientific article; zbMATH DE number 4045707 (Why is no real title available?)
• A notation for lambda terms. A generalization of environments
• Proof finding algorithms for implicational logics
• The systematic construction of a one-combinator basis for lambda-terms
• Equational Reasoning with Applicative Functors
• Expedited Broda-Damas bracket abstraction

This page was built for publication: Lambda terms definable as combinators

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