Matt Might personal blog
Compiling to λ-calculus
Though it contains forms only for function applications, variable references and anonymous functions, it is equivalent to a Turing machine.
- Points
- 114
- HN comments
- 41
- Submissions
- 2
- Cited by
- 3 commenters
Math & AlgorithmsSoftware Engineering2011
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Aug 24, 2011 | Compiling to λ-calculus by sindoc | 114 | 16 |
| Jan 17, 2011 | Compiling to lambda-calculus: Turtles all the way down by budu | 86 | 25 |
Cited in comments
Linked from 4 Hacker News comments by 3 different people, from Dec 2012 to May 2022.
Most recent:
- UncleEntity · May 7, 2022
- jacquesm · May 2, 2014
- Double_Cast · Nov 24, 2013
- jacquesm · Dec 17, 2012
