Lambda terms definable as combinators

DOI10.1016/S0304-3975(96)00111-9zbMath0868.03008MaRDI QIDQ1349878

Martin W. Bunder

Publication date: 27 February 1997

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

zbMATH Keywords

lambda termscombinatorsimplicational logicsnatural deduction systemscombinatory termHilbert-style systems

Mathematics Subject Classification ID

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

Related Items (4)

Expedited Broda-Damas bracket abstraction ⋮ Ticket Entailment is decidable ⋮ Equational Reasoning with Applicative Functors ⋮ Proof finding algorithms for implicational logics

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection types for combinatory logic
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• The proofs of α → α in P – W

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