Get the latest tech news
Forsp: A Forth+Lisp Hybrid Lambda Calculus Language
Recently I've discovered a very interesting language / realization of the Lambda Calculus. I was unable to find any other language like it, which I find quite surprising.
Most languages based on Lambda Calculus have to contend with a choice between Normal Order Evaluation (Call-By-Value,CBV) or Applicative-Order (Call-By-Name,CBN). It's also curious that Forsp programs can be viewed as either as one big long list of instructions (much like a Turing Machine) or as a realization of Lambda Calculau. Being able to actually use the Y-combinator for recursion That "force" didn't have to be a primitive Core stack manipulation operations can be written in Forsp (not generally doable in Forth) Currying and partial evaluation work nicely Originally $ and ^ were also special eval forms, but they didn't need to be The stack is just an ordinary cons list (used implicitly just like the environment) CBPV is actually pretty useful
Or read this on Hacker News