mbuliga / chemski
Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.
☆17Updated 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).☆19Updated last year
- Pure relational SKI combinator calculus interpreter.☆10Updated 7 years ago
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 6 years ago
- A compilation-friendly fexpr language. (Proof of concept.)☆21Updated 3 weeks ago
- Metamath verifier in Python☆37Updated 10 months ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆15Updated last year
- SECD microprocessor reimplementation in VHDL☆34Updated 5 years ago
- World's fastest FRACTRAN interpeter☆11Updated 2 years ago
- Intuitionistic Programming Language☆11Updated 11 years ago
- ☆19Updated 7 years ago
- software archaeology of reflective towers of interpreters☆15Updated 4 months ago
- lang Thue + Regex☆14Updated 2 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated 8 months ago
- Reason about Term Rewriting Systems☆16Updated 2 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- The Cubicle model checker☆13Updated 11 months ago
- Proof assistant for opetope and opetopic set derivation systems☆14Updated 4 years ago
- A Scheme-like Lisp interpreter that can also run as an operating system☆18Updated 11 years ago
- Common lisp implementation of Val Schorr's Meta-II language☆17Updated 7 years ago
- dependently-typed lisp with flexible compiler backends☆28Updated 5 years ago
- Lean 4 Metamath verifier☆17Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆69Updated 7 years ago
- SPSC: A Small Positive Supercompiler☆34Updated 8 months ago
- Tutorial for the CHR system☆16Updated 4 years ago
- Fast, simplified WAM-based Prolog system☆21Updated last year
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Updated 12 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆28Updated this week
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆13Updated 3 years ago
- This github repository hosts the code used within my thesis work and my last publication.☆12Updated 7 years ago