<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-08-23 01:56:39Software engineering Computer programming Computing Functional languages Evaluation strategy Computability theory Lambda calculus Theoretical computer science Lazy evaluation Functional programming ALGOL 68 Racket |
Add to Reading List |
From Stack Traces to Lazy Rewriting Sequences Stephen Chang1 , Eli Barzilay1 , John Clements2 , and Matthias Felleisen1 1 2![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")
