webyrd / relational-parsing-with-derivativesLinks
Relational version of parsing with derivatives code
☆43Updated 12 years ago
Alternatives and similar repositories for relational-parsing-with-derivatives
Users that are interested in relational-parsing-with-derivatives are comparing it to the libraries listed below
Sorting:
- Prolog-Style Meta-Interpreters in miniKanren☆33Updated 7 months ago
- Interpreter for the reversible functional language rFun☆37Updated 7 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- Normalization-by-evaluation in miniKanren☆24Updated 2 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆37Updated 2 weeks ago
- Logic for story telling!☆34Updated 7 years ago
- A categorical semantics library in Agda.☆16Updated 5 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 13 years ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- Datalog implemented in minikanren☆24Updated 8 years ago
- Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren☆34Updated 12 years ago
- An equational theorem prover based on Knuth-Bendix completion☆56Updated this week
- An extended typed Lambda Calculus☆21Updated last year
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- software archaeology of reflective towers of interpreters☆16Updated 4 months ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆136Updated 4 months ago
- ☆62Updated 6 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated 3 weeks ago
- A microKanren framework for implementing constraints.☆18Updated 7 years ago
- Real number computation software☆127Updated 3 years ago
- Relational interpeter combining miniKanren-in-miniKanren and Scheme-in-miniKanren☆18Updated 4 months ago
- Kanren with databases☆44Updated last year
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆65Updated 3 years ago
- A prototype of soft contract verification for an untyped functional language☆35Updated 4 years ago
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated last year
- Synthetic Topology in Homotopy Type Theory for probabilstic programming☆12Updated 7 years ago
- ☆56Updated 6 months ago
- Probabilistic Programming☆42Updated last week
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year