Jan 8, 2020 · This paper presents a method to evaluate untyped lambda terms based on a term tree-traversing technique and judicious use of eta-expansion.
Sep 16, 2019 · As traversals explore nodes of the term tree, they dynamically eta-expand some of the subterms in order to locate their non-immediate arguments.
This paper presents a method to evaluate untyped lambda terms based on a term tree-traversing technique and judicious use of eta-expansion. The traversal ...
Feb 28, 2018 · Abstract:We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique ...
This paper presents a method to evaluate untyped lambda terms based on a term tree-traversing technique and judicious use of eta-expansion. The traversal ...
It is proved that non-idempotent intersection type theories are able to precisely reflect the time performances of the interactive abstract machine, ...
blumu/travnorm: Implementation of traversals for the untyped lambda ...
github.com › blumu › travnorm
This project hosts implementations in TypeScript and Rust of lambda calculus term evaluation algorithm from the TCS paper Evaluating lambda terms with ...
We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics ...
Jul 4, 2015 · At the current state of knowledge, the best way of evaluating lambda terms is the so called optimal graph reduction technique.
Missing: traversals. | Show results with:traversals.
People also ask
How do you evaluate a lambda expression?
What is a free variable in lambda calculus?
What are bound variables in lambda functions?
Lambda calculus traversal evaluator. Implementations of lambda calculus term evaluation algorithm from the TCS paper Evaluating lambda terms with traversals.