Pages that link to "Item:Q2556396"
From MaRDI portal
The following pages link to Combinators, \(\lambda\)-terms and proof theory (Q2556396):
Displayed 26 items.
- The semantics of second-order lambda calculus (Q751294) (← links)
- A solution to Curry and Hindley's problem on combinatory strong reduction (Q1014284) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- On the implementation of abstract data types by programming language constructs (Q1089793) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Algebra of constructions. I. The word problem for partial algebras (Q1107515) (← links)
- The calculus of constructions (Q1108266) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Prelogic of logoi (Q1233435) (← links)
- Fully abstract models of typed \(\lambda\)-calculi (Q1249567) (← links)
- Theory of proofs (arithmetic and analysis) (Q1260035) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels (Q1923579) (← links)
- Polymorphic lambda calculus: The Church-Rosser property (Q2276943) (← links)
- (Q3858241) (← links)
- Definition of the semantics of programming language constructs in terms of ?-calculus. I (Q3953161) (← links)
- Ein starker Normalisationssatz für die bar-rekursiven Funktionale (Q4121888) (← links)
- A sequent calculus for type assignment (Q4147961) (← links)
- (Q4680256) (← links)
- Intuitive counterexamples for constructive fallacies (Q5096872) (← links)
- Inductive-data-type systems (Q5958292) (← links)
- On the proof theory of Coquand's calculus of constructions (Q5961667) (← links)