There are some implementations of computation theory in Ruby.
-
Updated
Jan 4, 2019 - Ruby
There are some implementations of computation theory in Ruby.
SKI combinator calculus implemented in OCaml
Lambdifies VM
A deBruijn implementation of the untyped lambda calculus implementation focused on equivalence proofs, a self-interpreter, and a verified compiler to SK
An automated theorem discovery system
A SKI universe
Lambda Calculus to Ski compiler and runtime.
Implementing a small functional language with a combinator graph reduction engine
🐦 *cheep cheep shriek caw*
A simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust
Common combinators for Elixir
Add a description, image, and links to the ski-combinators topic page so that developers can more easily learn about it.
To associate your repository with the ski-combinators topic, visit your repo's landing page and select "manage topics."