Pages that link to "Item:Q3011126"
From MaRDI portal
The following pages link to A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126):
Displaying 5 items.
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness (Q730088) (← links)
- A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
- A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG (Q2493750) (← links)
- A Proof-Theoretic Account of Programming and the Role of Reduction Rules (Q3830972) (← links)
- Lambda terms for natural deduction, sequent calculus and cut elimination (Q4948037) (← links)