Combinators, -terms and proof theory
From MaRDI portal
Publication:2556396
Cited in
(26)- A solution to Curry and Hindley's problem on combinatory strong reduction
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- A characterization of F-complete type assignments
- On the implementation of abstract data types by programming language constructs
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Algebra of constructions. I. The word problem for partial algebras
- The calculus of constructions
- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- Higher-order rewrite systems and their confluence
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
- Prelogic of logoi
- Fully abstract models of typed \(\lambda\)-calculi
- Theory of proofs (arithmetic and analysis)
- Combinatory reduction systems: Introduction and survey
- Typing and computational properties of lambda expressions
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels
- Polymorphic lambda calculus: The Church-Rosser property
- scientific article; zbMATH DE number 3659565 (Why is no real title available?)
- Definition of the semantics of programming language constructs in terms of ?-calculus. I
- Ein starker Normalisationssatz für die bar-rekursiven Funktionale
- A sequent calculus for type assignment
- scientific article; zbMATH DE number 2172859 (Why is no real title available?)
- Intuitive counterexamples for constructive fallacies
- Inductive-data-type systems
- On the proof theory of Coquand's calculus of constructions
- The semantics of second-order lambda calculus
This page was built for publication: Combinators, \(\lambda\)-terms and proof theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556396)
