A small demo project performing normal-order evaluation of untyped lambda calculus terms. It wraps the library https://github.com/stfnw/lambda-calculus-full-reducing ...
This is a demo project implementing normal-order evaluation of untyped lambda calculus terms. (Goal is me learning; this project will probably not be maintained further). It does this through a ...
Abstract: Bohm tree equivalence up to possibly infinite eta expansion for the pure lambda-calculus can be characterized as a bisimulation equivalence. We call this co-inductive syntactic theory ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback