chemlambda / molecular
Molecular computers with interaction combinators like graph rewrite systems
☆9Updated 2 years ago
Alternatives and similar repositories for molecular:
Users that are interested in molecular are comparing it to the libraries listed below
- bddem is a SWI-Prolog pack for using Binary Decision Diagrams☆11Updated last year
- Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.☆18Updated last year
- The axiom profiler for exploring and visualizing SMT solver quantifier instantiations (made via E-matching).☆32Updated last month
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 2 years ago
- A collection of lambda calculus interpreters and development tools☆14Updated 2 years ago
- Preview Zig's incremental linker state in interactive HTML☆44Updated 3 years ago
- Binary rational numbers in Coq [maintainer=@herbelin]☆14Updated last year
- Slog 1.0☆39Updated 9 months ago
- Continuous functions formalized in Lean4. A students project accompanied by a YouTube video.☆13Updated 8 months ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- A Lean 4 formalization of partial combinatory algebras.☆13Updated 2 months ago
- Binary lambda calculus☆10Updated 7 years ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆13Updated 3 years ago
- Development for: Formally Verified Speculation and Deoptimization in a JIT Compiler☆11Updated 2 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- Operations with matrices, SWI pack☆13Updated last year
- An experimental Racket implementation using LLVM/MLIR☆62Updated last year
- Render, select coordinates, export to video and more.☆14Updated 11 months ago
- A revival of the TREE-META compiler-compiler.☆15Updated 6 years ago
- Intuitionistic Programming Language☆11Updated 11 years ago
- ☆14Updated last year
- A formal proof of an exponentially better upper bound on Ramsey numbers☆14Updated last year
- Pull your compiler up with abstract bootstraps.☆31Updated 2 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Category Theory & Cobordism Categories in Lean 4☆16Updated 9 months ago
- ☆19Updated 8 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- sorear's Metamath system engine☆13Updated 8 years ago
- Reversible programming in Agda☆12Updated last year
- A toy compiler for NumPy array expressions that uses e-graphs and MLIR☆32Updated last week