<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2017-09-19 19:50:55Mathematical logic Theoretical computer science Mathematics Type theory Logic in computer science Dependently typed programming Formal methods Logical framework Proof theory First-order logic Lambda calculus Calculus of constructions |
Add to Reading List |
Analyzing individual proofs as the basis of interoperability between proof systems Gilles Dowek? Abstract. We describe the first results of a project to analyze in which theories formal proofs can be expressed and use th![Remarks on Krivine’s ”Lambda-calculus, types and models”, Chapter 1, §2 Darij Grinberg, 5 JuneIntroduction The point of this note is to 1) add some lemmata to Chapter 1 §2 of [1] (lemmata that are used i](https://www.pdfsearch.io/img/1d332c8e20b484736ac15370261a341b.jpg "Remarks on Krivine’s ”Lambda-calculus, types and models”, Chapter 1, §2 Darij Grinberg, 5 JuneIntroduction The point of this note is to 1) add some lemmata to Chapter 1 §2 of [1] (lemmata that are used i")
![Variable-free Formalization of the Curry-Howard Theory W. W. Tait The reduction of the lambda calculus to the theory of combinators in [Sch¨onfinkel, 1924] applies to positive implicational logic, i.e. to the typed lam](https://www.pdfsearch.io/img/3eb38529e5c4059e0dff4ede5483e467.jpg "Variable-free Formalization of the Curry-Howard Theory W. W. Tait The reduction of the lambda calculus to the theory of combinators in [Sch¨onfinkel, 1924] applies to positive implicational logic, i.e. to the typed lam")
