Search Results for "lambda calculus"

Proof Logic is a functional and equational logical framework for theorem proving based on Combinatory Logic and Lambda Calculus, whose expressions are both terms and proofs proving the equality between two terms.

LIPS is an easy-to-use command line interpreter for the lambda-calculus. It supports different evaluation strategies, a trace-mode, abbreviations and typing. Furthermore LIPS allows to export interpreter-sessions to a user-definable format (e.g., LaTeX).

LPIA is an interpreted symbolic functional language with multi-process capabilities and predefined pattern matching. It is inspired by combinatory logic, lambda calculus, Scheme and Forth. LPIA est un langage symbolique fonctionnel interprété avec des possibilités multi-processus et un filtrage prédéfini. Il est inspiré par la logique combinatoire, le lambda calcul, Scheme et Forth.

LCI is an interpreter for the lambda calculus. It supports many advances features like integers, recursion, user defined operators and multiple evaluation strategies.

A simple .NET/mono application which interprets and evaluates untyped lambda calculus expressions.

Pagkalos is an interpreted language written in Java. It supports the lambda-calculus and object-oriented techniques. All statements are writeen in reversed polish notation. Java-classes, objects and methods are easily accessible with the dot-notation.

An interpreter of lambda calculus. It shows reduction process of lambda terms. Several evaluation strategies are supported. Output format can be selected from LaTex, plain text.

This is a collection of several simple functional languages all based on combinator graph reduction techniques for interpretation. For now there's only one package here: lazy-l, which is an interpreter for Alonzo Church's untyped lambda calculus.