A simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust

🐦 *cheep cheep shriek caw*

Implementing a small functional language with a combinator graph reduction engine

A deBruijn implementation of the untyped lambda calculus implementation focused on equivalence proofs, a self-interpreter, and a verified compiler to SK

Lambda Calculus to Ski compiler and runtime.

Common combinators for Elixir

A SKI universe

An automated theorem discovery system

There are some implementations of computation theory in Ruby.

SKI combinator calculus implemented in OCaml

Lambdifies VM