<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2017-05-11 23:26:18Software engineering Computing Programming language theory Type theory Type systems Lambda calculus Subroutines Data types Gradual typing Racket Go Programming language |
Add to Reading List |
Migratory Typing: Ten Years Later∗ Sam Tobin-Hochstadt1 , Matthias Felleisen2 , Robert Bruce Findler3 , Matthew Flatt4 , Ben Greenman5 , Andrew M. Kent6 , Vincent St-Amour7 , T. Stephen Strickland8 , and Asumu Takikawa![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")
