tau-prolog / draw-derivation-treesLinks
A tool for drawing derivation trees of Tau Prolog
☆11Updated 3 years ago
Alternatives and similar repositories for draw-derivation-trees
Users that are interested in draw-derivation-trees are comparing it to the libraries listed below
Sorting:
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated 2 weeks ago
- Art of Prolog Code☆36Updated 6 years ago
- A tutorial for DCG's in swi-Prolog☆34Updated 4 years ago
- MUD Server written in Prolog using Forward chaining☆28Updated 3 years ago
- Run SWI-Prolog in your browser using WebAssemply☆77Updated 3 years ago
- Boolean Constraint Solving in Prolog☆48Updated 10 months ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- Fast, simplified WAM-based Prolog system☆24Updated 5 months ago
- SWI-Prolog dynamic C interface☆17Updated last year
- Our Ludum Dare entry☆20Updated 8 years ago
- Explainable machine learning☆17Updated 6 years ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 13 years ago
- Mystery Languages☆41Updated 2 years ago
- A formalization of synthetic differential geometry in Coq using infinitesimal analysis☆11Updated 4 years ago
- Functional Geometry in Prolog☆18Updated 5 years ago
- Kanren with databases☆44Updated last year
- Prolog Reverse Proxy☆20Updated 7 years ago
- CLP(BNR) module for SWI-Prolog☆44Updated 5 months ago
- A metalanguage for creating sophisticated DSLs in Racket.☆37Updated last week
- User Interfaces for Programming Languages: The Compendium☆28Updated 4 years ago
- A WAM (Warren Abstract Machine for Prolog) written in Common Lisp☆13Updated 6 years ago
- Fuzzy Aggregators and Similarity Into a Logic Language☆26Updated last year
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- CHR: Leuven Constraint Handling Rules☆26Updated last week
- Interpreter for the reversible functional language rFun☆37Updated 7 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 8 years ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 5 months ago
- Accompanying materials for "A Core Calculus for Documents"☆34Updated 2 years ago
- Operations with matrices, SWI pack☆13Updated last year