An extensible pattern matching, pattern dispatch, and term rewriting system for MIT Scheme.
☆21Mar 19, 2024Updated last year
Alternatives and similar repositories for rules
Users that are interested in rules are comparing it to the libraries listed below
Sorting:
- A library for intelligently plotting functions from the MIT Scheme REPL.☆21Feb 2, 2013Updated 13 years ago
- A formalization of (homotopy) limits in Homotopy Type Theory☆11Jan 11, 2015Updated 11 years ago
- A library for recreational number theory in MIT Scheme.☆11Feb 2, 2013Updated 13 years ago
- Visual graph rewriting platform☆10Jun 3, 2025Updated 8 months ago
- Reversible programming in Agda☆13Jun 22, 2023Updated 2 years ago
- SRFI libraries for Chez Scheme☆10Mar 21, 2010Updated 15 years ago
- a Rust implementation of first-order term rewriting systems (TRS)☆29Dec 28, 2021Updated 4 years ago
- Dendriform di-algebra algorithms to compute using Loday's arithmetic on groves of planar binary trees☆16Dec 7, 2019Updated 6 years ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Feb 7, 2020Updated 6 years ago
- A Julia interface to the PATH solver☆15Jan 26, 2021Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- A unit test framework for MIT Scheme in the jUnit style.☆14Nov 30, 2015Updated 10 years ago
- Algebraic simplification in Julia☆84Sep 25, 2019Updated 6 years ago
- Reason about Term Rewriting Systems☆18Jul 24, 2022Updated 3 years ago
- R7RS SRFI implementations☆33Oct 2, 2024Updated last year
- Port of SwiftyKanren to Kotlin☆18Feb 8, 2021Updated 5 years ago
- BigWIG, BigBED and TDF for the JVM☆14Feb 23, 2021Updated 5 years ago
- Parsing with "disambiguation filters" in Clojure☆22Jan 11, 2017Updated 9 years ago
- A Clojure implementation of the Union-Find data structure☆28May 23, 2024Updated last year
- Research project: Program synthesis using updated interface, template and types.☆14Dec 2, 2020Updated 5 years ago
- A meta-language for adding Clojure-style shorthand function literals to arbitrary Racket languages.☆18Oct 20, 2016Updated 9 years ago
- Selective applicative functors laws and theorems☆15Mar 12, 2020Updated 5 years ago
- KITTeL/KoAT☆21Dec 19, 2018Updated 7 years ago
- Partition refinement☆16Sep 11, 2023Updated 2 years ago
- The Flix Programming Book☆21Updated this week
- a minimal implementation of incremental computation in Scheme☆37Apr 30, 2017Updated 8 years ago
- GNU Guile Scheme bindings for OCaml☆18Aug 5, 2022Updated 3 years ago
- An efficient symbolic term rewriting engine☆78Dec 23, 2020Updated 5 years ago
- An integrated context-aware scanner and parser generator☆22Dec 4, 2023Updated 2 years ago
- The Solo5 unikernel☆14Apr 10, 2019Updated 6 years ago
- ☆20Jun 12, 2023Updated 2 years ago
- Oleg Kiselyov's minimal implementation of logic programming☆24Feb 5, 2013Updated 13 years ago
- Julia embedded in Haskell☆52Dec 14, 2024Updated last year
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 17, 2026Updated last week
- Identifying similar OCaml codes☆30Jul 30, 2024Updated last year
- Racket-based implementation of Adapton☆24Jun 29, 2019Updated 6 years ago
- PostgreSQL binding for R7RS Scheme.☆21Dec 11, 2017Updated 8 years ago
- The Termination Problem Database☆29Aug 20, 2025Updated 6 months ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month