axch / rulesLinks
An extensible pattern matching, pattern dispatch, and term rewriting system for MIT Scheme.
☆19Updated last year
Alternatives and similar repositories for rules
Users that are interested in rules are comparing it to the libraries listed below
Sorting:
- Single-spaced version of my dissertation, 'Relational Programming in miniKanren: Techniques, Applications, and Implementations'☆59Updated 6 years ago
- Reason about Term Rewriting Systems☆16Updated 3 years ago
- Probabilistic miniKanren☆63Updated 9 years ago
- software archaeology of reflective towers of interpreters☆16Updated last month
- A metalanguage for creating sophisticated DSLs in Racket.☆32Updated last week
- ☆39Updated this week
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated last year
- a minimal implementation of incremental computation in Scheme☆35Updated 8 years ago
- Normalization-by-evaluation in miniKanren☆24Updated 2 years ago
- A meta-language for adding Clojure-style shorthand function literals to arbitrary Racket languages.☆17Updated 8 years ago
- Collapsing Towers of Interpreters (in Scheme)☆57Updated 6 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- Prolog-Style Meta-Interpreters in miniKanren☆33Updated 4 months ago
- Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren☆34Updated 12 years ago
- The PGG Partial Evaluation System for Scheme 48☆18Updated 12 years ago
- Summaries of intro and advanced miniKanren hangout series☆28Updated 7 years ago
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆36Updated 3 years ago
- Probabilistic Programming☆42Updated last week
- Oleg Kiselyov's minimal implementation of logic programming☆23Updated 12 years ago
- Relational Programming in miniKanren☆52Updated 10 years ago
- miniKanren variant with a functional syntax, expressing disjunction via pattern matching☆17Updated 5 years ago
- A data frame implementation for Racket☆37Updated last year
- ☆12Updated last year
- nqthm - the original Boyer-Moore theorem prover, from 1992☆54Updated 8 years ago
- Kanren with databases☆44Updated last year
- A Scala-style magic function application form☆43Updated 3 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated last year
- miniKanren for search, SMT for solving☆13Updated 5 years ago