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

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.

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.

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.

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.