Implementation of a CEK machine
-
Updated
Mar 10, 2019 - OCaml
Implementation of a CEK machine
[WIP] A series of tutorials for lambda calculus
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.
Simple Lambda interpreter in OCaml with syntactic sugar
An implementation of dependently typed lambda calculus
Lambda Calculus Interpreter with Definitions
Implementation of a CK machine
Dependently typed lambda calculus - A Simple Proof Assistant
My Attempt at System Fω with Row-Polymorphism
Type checking, type inference, Church, Curry, polymorphe types, Unification theory, ... All type theory related
Lambda Calculus implementations in OCaml.
Interpreter for a functional, expression-based programming language
Intensional PCF interpreter
Implementation of Algorithm W
Implementation of the lambda calculus
Various implementations of normalization by evaluation.
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."