An interactive theorem prover based on lambda-tree syntax
-
Updated
Nov 17, 2024 - OCaml
An interactive theorem prover based on lambda-tree syntax
Abstract krivine machine implementing call-by-name semantics. In OCaml.
My Attempt at System Fω with Row-Polymorphism
Step-by-step Lambda calculus interpreter for AO, CBN, CBV, NOR strategies
An implementation of Linear Lambda Calculus.
Dependently typed lambda calculus - A Simple Proof Assistant
Various implementations of normalization by evaluation.
Source code for TAPL
An implementation of dependently typed lambda calculus
OCaml implementation of a Lambda Calculus Interpreter
Lambda Calculus implementations in OCaml.
Implementation of a CEK machine
Lambda Calculus Interpreter with Definitions
Implementation of a CK machine
Implementation of the lambda calculus
A type theory for unbiased cartesian closed categories.
Implementation of Algorithm W
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."