nathanielrb / ftmicroKanrenLinks
First-order temporal logic programming with microKanren
☆18Updated 7 years ago
Alternatives and similar repositories for ftmicroKanren
Users that are interested in ftmicroKanren are comparing it to the libraries listed below
Sorting:
- Kanren with databases☆44Updated last year
- Collapsing Towers of Interpreters (in Scheme)☆57Updated 7 years ago
- Java-based lightweight Prolog virtual machine☆34Updated last year
- A DSL for runtime code generation in racket☆67Updated 3 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- A simple Prolog API for the Z3 constraint solver☆15Updated 7 years ago
- Probabilistic miniKanren☆65Updated 9 years ago
- ☆34Updated 4 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- a minimal implementation of incremental computation in Scheme☆36Updated 8 years ago
- Lojban ologs (categorical databases) using jq☆24Updated 6 years ago
- A compiler to IA32 and REPL for maru in maru under 7k s-expressions☆18Updated 5 years ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- An extensible pattern matching, pattern dispatch, and term rewriting system for MIT Scheme.☆21Updated last year
- Kali is Kelsey and Rees's distributed Scheme implementation based on Scheme48☆38Updated 13 years ago
- Single-spaced version of my dissertation, 'Relational Programming in miniKanren: Techniques, Applications, and Implementations'☆59Updated 6 years ago
- A microKanren framework for implementing constraints.☆18Updated 7 years ago
- Gradual WAM implementation using Hassan Aït-Kaci's tutorial reconstruction☆28Updated 7 years ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- Consize is a concatenative programming language☆36Updated 7 months ago
- An experimental Racket implementation using LLVM/MLIR☆62Updated 2 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- An implementation of Oz on top of Truffle and Graal☆42Updated 3 years ago
- SOMns: A Newspeak for Concurrency Research☆70Updated 7 months ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last week
- Auto define Racket bindings to C by parsing header files.☆30Updated 3 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆136Updated 3 months ago
- Racket-based implementation of Adapton☆22Updated 6 years ago
- Apply and compose functions in Prolog☆19Updated 8 years ago
- Datalog implemented in minikanren☆24Updated 8 years ago