Pages that link to "Item:Q4948037"
From MaRDI portal
The following pages link to Lambda terms for natural deduction, sequent calculus and cut elimination (Q4948037):
Displaying 19 items.
- Implications-as-rules vs. implications-as-links: an alternative implication-left schema for the sequent calculus (Q626494) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- Choices in representation and reduction strategies for lambda terms in intensional contexts (Q861365) (← links)
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- A notation for lambda terms. A generalization of environments (Q1129257) (← links)
- Lambda terms definable as combinators (Q1349878) (← links)
- What is the meaning of proofs?. A Fregean distinction in proof-theoretic semantics (Q2037304) (← links)
- Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment (Q2254561) (← links)
- Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning (Q2339009) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126) (← links)
- Characterising Strongly Normalising Intuitionistic Sequent Terms (Q3499751) (← links)
- Computation with classical sequents (Q3520146) (← links)
- Strong cut-elimination in sequent calculus using Klop's <i>ι</i>-translation and perpetual reductions (Q3617369) (← links)
- Pruning simply typed -terms (Q4716047) (← links)
- Cut Elimination in a Class of Sequent Calculi for Pure Type Systems (Q4924532) (← links)
- (Q5227517) (← links)
- (Q5227518) (← links)
- Revisiting Zucker’s Work on the Correspondence Between Cut-Elimination and Normalisation (Q5251185) (← links)
