Search Results for "lambda calculus"

Curated roadmap to Programming Language Theory, collecting seminal papers, books, and resources into a navigable structure for self-study. It spans foundational topics like lambda calculus, type systems, interpreters, compilers, and formal semantics, while also pointing to contemporary areas such as effect systems, dependent types, and verification. Each section clusters materials by theme so learners can build understanding step by step instead of grazing at random. The list emphasizes primary sources and high-quality lectures, encouraging readers to engage with rigorous treatments rather than superficial summaries. ...

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).

Symbolic Lambda Calculus is a logical formalism based on lambda calculus and combinatory logic, in which there is only one kind of objects, which can represent either terms or equalities. It uses de Bruijn's and lambda calculus notations.

The Penn Lambda Calculator is an interactive, graphics-based pedagogical software that helps students of linguistics and computer science practice the typed lambda calculus.

...Among other features it provides o a template instantiation machine for evaluating the value of an lambda calculus expression, o a template instantiation machine for evaluating the Hindley-Milner type (http://en.wikipedia.org/wiki/Hindley-Milner) of an lambda calculus expression, and o reference counter based memory management for lambda calculus expressions and types. "libmx" is written in C (C99).

Implementation of Combinatory Reduction Systems (CRS) with experimental extensions, in Java. CRS is a formalism for higher-order rewriting invented by J.W.Klop in 1980. For further details see the Project/Web Site.

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.

My personal computing suite provides some programs I developed as a hobbyist and currently include a lambda calculus interpreter and a calculator which solves arithmetic expressions; both are written in C++.

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.