3 ms·
I think, taken to the extreme, all programming languages would then "just" be syntactic sugar over lambda calculus
by Bjartr 9y ago
I think, taken to the extreme, all programming languages would then "just" be syntactic sugar over lambda calculus
- mtreis86 9y agoGreenspun's tenth rule: Any sufficiently complicated C or Fortran program contains an ad-hoc, informally-specified, bug-ridden, slow implementation of half of Common Lisp.
- deleted 9y ago[deleted]
- kerkeslager 9y agoThat's true, but I think you look at my example you'll see that it's not that extreme. There's a 1-to-1 correspondence between each function call in Exhibit B and each semantic element in Exhibit A. Such a correspondence doesn't exist between most programming languages and assembly, let alone lambda calculus.