jMotif / GI
Sequitur and RePair grammar induction algorithms implementation
☆24Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for GI
- JudgeD: Probabilistic Datalog with Dependencies☆18Updated 5 years ago
- ☆28Updated last year
- My MSc thesis: a grammar induction system☆15Updated 8 years ago
- Primary implementation of the Venture probabilistic programming system☆28Updated 5 years ago
- Probabilistic miniKanren☆62Updated 9 years ago
- A collection of demonstration languages in Lua/Terra suitable for learning or for forking when creating a new language☆10Updated 9 years ago
- Relational version of parsing with derivatives code☆42Updated 11 years ago
- VATA Tree Automata Library☆32Updated 3 months ago
- System for eXtended Hybrid Abductive Inductive Learning☆24Updated 3 years ago
- Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren☆33Updated 11 years ago
- software archaeology of reflective towers of interpreters☆15Updated last month
- Explainable machine learning☆18Updated 5 years ago
- Relational interpeter combining miniKanren-in-miniKanren and Scheme-in-miniKanren☆16Updated last week
- Library classes for the Twelf Proof System☆21Updated 4 years ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 13 years ago
- ☆19Updated 7 years ago
- Evolutionary feature synthesis☆17Updated 9 years ago
- SWI-Prolog 2-Way interface to Commmon Language Interface☆12Updated 7 years ago
- Python term rewriting☆27Updated 11 years ago
- Optimizing Synthesis with Metasketches, POPL 2016☆23Updated 7 years ago
- Neural Guided Constraint Logic Programming for Program Synthesis☆92Updated 5 years ago
- purple: compiling a reflective language☆30Updated last month
- cplint is a suite of programs for reasoning with probabilistic logic programs☆69Updated last week
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Updated 12 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 11 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆67Updated last year
- A heuristic procedure for proving inequalities☆32Updated 6 years ago