An interactive theorem prover based on lambda-tree syntax
-
Updated
Jan 25, 2026 - OCaml
An interactive theorem prover based on lambda-tree syntax
Introduction to the Untyped Lambda Calculus by covering the basics and then writing an Interpreter
msfl-hl is a lambda-calculus term interpet written in OCaml
A type theory for unbiased cartesian closed categories.
A compiler of the Lambda-Calculus to 16-bit x86 assembly code
Implementation for the lambda lambda-bar calculus (LLBC)
Interpreter for Lamba-expressions
Intensional PCF interpreter
Lenguaje lambda cálculo implementado en OCaml
Step-by-step Lambda calculus interpreter for AO, CBN, CBV, NOR strategies
Interpreter for a functional, expression-based programming language
A typed lambda calculus with a set-theoretic type system, that serves as the theoretical basis for other languages with set-theoretic type systems
The OCaml-lite interpreter is a streamlined tool for parsing and executing OCaml-lite programs, offering insights into programming language interpretation with a focus on simplicity and educational value.
Lambda Calculus Interpreter with Definitions
[WIP] A series of tutorials for lambda calculus
An implementation of dependently typed lambda calculus
Lambda Calculus implementations in OCaml.
Add a description, image, and links to the lambda-calculus topic page so that developers can more easily learn about it.
To associate your repository with the lambda-calculus topic, visit your repo's landing page and select "manage topics."