3 ms·
Nice take on lambda calc! It looks like you're making use of beta-reduction for the eval engine. Shen has a more formal take on lambda calc, and I think it's us
by alexisread 4y ago
Nice take on lambda calc! It looks like you're making use of beta-reduction for the eval engine.
Shen has a more formal take on lambda calc, and I think it's useful for more advanced constructs like type checking. Shen actually uses K-lambda (a lispish version of lambda calc) as part of it's compiler Sequent-calc->Prolog->Shen->K-lambda->VM:
https://shenlanguage.org/TBoS/tbos_170.html https://shenlanguage.org/TBoS/tbos_170.html
- mattgreenrocks 4y agoThis is really cool, thanks for linking that.
- martyalain 4y agoMy first goal was to write in a wiki using a light and extended HTML. I then discovered LISP and lambda-calculus. I built an "inverted" evaluator working directly on s-expressions (without AST), ignoring words (which therefore did not have to be protected by apostrophes and quotation marks), like in basic HTML. I can thus write wiki pages that are lambdatalk programs, mixing pure text and code effortlessly. It's my all-purpose tool.
- all2 4y agoDo you have a write up on this tool somewhere? This sounds really cool!
- martyalain 4y agoThank you, everything starts in this page http://lambdaway.free.fr/lambdawalks http://lambdaway.free.fr/lambdawalks
- voxl 4y agoHow is beta reduction not "formal"???
- alexisread 4y agoSorry I wasn't clear - beta-reduction is formal, I was trying to refer to the extension of the formal treatment of lambdas to cover proofs, formal logic and typechecking. Shen does this for typechecking.