mbuliga / chemski
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
- 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☆20Updated 4 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Simple Neural Network Examples in 8 lines APL☆31Updated last year
- Reason about Term Rewriting Systems☆16Updated 2 years ago
- MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail☆13Updated last year
- a 666-byte, public domain SKI combinator calculus evaluator in C, minsky machines and other stuff☆11Updated 4 years ago
- A Scheme-like Lisp interpreter that can also run as an operating system☆18Updated 11 years ago
- Category Theory in Programming☆12Updated 3 weeks ago
- An Impractical Stack Language☆14Updated 4 years ago
- Tutorial for the CHR system☆16Updated 4 years ago
- An Image Dictionary for Co-dfns☆14Updated 7 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- various toys in j☆12Updated 3 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- Intuitionistic Programming Language☆11Updated 11 years ago
- A compilation-friendly fexpr language. (Proof of concept.)☆21Updated 3 months ago
- MIRROR of https://codeberg.org/catseye/Tamsin : Somewhere between a meta-language, a programming language, and a rubbish lister☆16Updated last year
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- A scheme port of the Haskell code from "A Tutorial Implementation of a Dependently Typed Lambda Calculus"☆8Updated 11 years ago
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 7 years ago
- SECD microprocessor reimplementation in VHDL☆35Updated 5 years ago
- software archaeology of reflective towers of interpreters☆16Updated 7 months ago
- Common lisp implementation of Val Schorr's Meta-II language☆18Updated 8 years ago
- A library for non-deterministically parsing natural language expressions into a structured form.☆17Updated 2 years ago
- lang Thue + Regex☆14Updated 3 years ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆13Updated 3 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- Fast, simplified WAM-based Prolog system☆22Updated last week