mbuliga / chemskiLinks
Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.
☆18Updated last year
Alternatives and similar repositories for chemski
Users that are interested in chemski are comparing it to the libraries listed below
Sorting:
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Library of js programs and demos for quines in graph-rewriting systems (for now chemlambda and interaction combinators).☆22Updated 2 years ago
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- ☆19Updated 8 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- ☆14Updated 4 years ago
- Proof assistant for opetope and opetopic set derivation systems☆15Updated 5 years ago
- SECD microprocessor reimplementation in VHDL☆35Updated 5 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- The Cubicle model checker☆13Updated last year
- Reason about Term Rewriting Systems☆16Updated 2 years ago
- Operations with matrices, SWI pack☆13Updated last year
- MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail☆13Updated last year
- Fast, simplified WAM-based Prolog system☆22Updated 3 weeks ago
- a 666-byte, public domain SKI combinator calculus evaluator in C, minsky machines and other stuff☆11Updated 4 years ago
- Simple Neural Network Examples in 8 lines APL☆31Updated last year
- An Impractical Stack Language☆14Updated 4 years ago
- A compilation-friendly fexpr language. (Proof of concept.)☆21Updated 4 months ago
- LODA is an assembly language, a computational model and a tool for mining integer sequence programs.☆21Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A revival of the TREE-META compiler-compiler.☆15Updated 7 years ago
- Reason about Bitcoin addresses with Prolog☆22Updated last year
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 7 years ago
- lang Thue + Regex☆14Updated 3 years ago
- A Scheme-like Lisp interpreter that can also run as an operating system☆18Updated 11 years ago
- Binary rational numbers in Coq [maintainer=@herbelin]☆14Updated last year
- Binary lambda calculus☆10Updated 7 years ago
- S-expressions in Python. Python cross-version compiler. Clean and efficient LISP back end.☆17Updated 4 years ago