Beta Reduction is Invariant, Indeed (Long Version) · HackerPapers discussions

Beta Reduction is Invariant, Indeed (Long Version) — mentioned by mananaysiempre

Fri, 17 Sep 2021 09:14:01 GMT

Didn’t have access to my archive at the time, so got some of the details wrong it seems (e.g. CbV not CbN, result for time is older than I remembered). Main thrust should remain valid, but be careful. In any case, here you go: Dal Lago, Martini (2008). “The weak lambda calculus as a reasonable machine”. DOI:10.1016/j.tcs.2008.01.044, apparently not on arXiv. Accattoli (2012). “A fresh look at the lambda-calculus”. DOI: 10.4230/LIPIcs.FSCD.2019.1, apparently not on arXiv. Accattoli, Dal Lago (2014). “Beta reduction is invariant, indeed”. DOI: 10.1145/2603088.2603105, arXiv: 1405.3311 [cs.LO].…

Paper and discussion history. A mention is not an endorsement.

Beta Reduction is Invariant, Indeed (Long Version) — mentioned by pron

Fri, 04 Dec 2015 10:38:47 GMT

If you don't understand what I'm saying -- and that could be entirely my fault -- you can just ask. If you (mistakenly) assume that by 2 + 2 I mean the expression "2 + 2" rather than the computation 2 + 2, why not assume that you may have missed something (which is the actual case) rather than assume that I don't understand the basics (which is not)? Since I don't wish to discuss this topic further with rude people, but I do wish to explain my point to other readers, I'll note that the entire concept of computational complexity, which is probably the most important concept in all of computer…

Paper and discussion history. A mention is not an endorsement.