<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2016-04-16 20:16:50Software engineering Type theory Computing Programming language theory Type system CurryHoward correspondence Typed lambda calculus Simply typed lambda calculus Type rule Type safety Typing environment Go |
Add to Reading List |
Fuzzing the Rust Typechecker Using CLP Kyle Dewey Jared Roesch Ben Hardekopf![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")
