npe9 / aopLinks
Art of Prolog Code
☆36Updated 6 years ago
Alternatives and similar repositories for aop
Users that are interested in aop are comparing it to the libraries listed below
Sorting:
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- Kanren with databases☆44Updated last year
- Boolean Constraint Solving in Prolog☆46Updated 9 months ago
- Single-spaced version of my dissertation, 'Relational Programming in miniKanren: Techniques, Applications, and Implementations'☆59Updated 6 years ago
- Simple Neural Network Examples in 8 lines APL☆31Updated 2 years ago
- Lojban ologs (categorical databases) using jq☆24Updated 6 years ago
- A concatenative programming language founded on the unholy trinity of Forth, Lisp and RDF triples.☆70Updated 14 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- Racket-based implementation of Adapton☆22Updated 6 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- Oleg Kiselyov's minimal implementation of logic programming☆24Updated 12 years ago
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- A DSL for runtime code generation in racket☆67Updated 3 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆32Updated last month
- Prolog stuff☆27Updated 6 years ago
- Collapsing Towers of Interpreters (in Scheme)☆57Updated 7 years ago
- A programming argot☆58Updated last year
- ☆34Updated 4 years ago
- Fast, simplified WAM-based Prolog system☆24Updated 4 months ago
- A core concatenative programming language with variables and first-rank polymorphic type inference☆31Updated 5 years ago
- experimental computational medium and supporting tools☆23Updated last week
- Reason about Term Rewriting Systems☆17Updated 3 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago
- debugging biological networks to reach coherence, completeness and consistency☆47Updated last year
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- CHR: Leuven Constraint Handling Rules☆26Updated this week
- Forth emulator, as a Racket #lang☆21Updated 2 years ago
- DocLog builds documentation from source code in Prolog☆28Updated 8 months ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago