Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
From MaRDI portal
Publication:3305634
DOI10.1007/978-3-030-20447-1_13zbMath1469.03042OpenAlexW2968770011MaRDI QIDQ3305634
Publication date: 10 August 2020
Published in: Mathesis Universalis, Computability and Proof (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-20447-1_13
Cites Work
- Unnamed Item
- A direct proof of the confluence of combinatory strong reduction
- Combinatory logic. With two sections by William Craig.
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
- A solution to Curry and Hindley's problem on combinatory strong reduction
- Analytic combinatory calculi and the elimination of transitivity
- Strong reduction and normal form in combinatory logic
- A Short Proof of Curry's Normal Form Theorem