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 9 months ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- software archaeology of reflective towers of interpreters☆16Updated 6 months ago
- A metalanguage for creating sophisticated DSLs in Racket.☆38Updated 2 months ago
- Interpreter for the reversible functional language rFun☆38Updated 7 years ago
- Normalization-by-evaluation in miniKanren☆25Updated 2 years ago
- Datalog implemented in minikanren☆24Updated 8 years ago
- Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren☆34Updated 12 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Updated 13 years ago
- Logic for story telling!☆36Updated 7 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆138Updated last month
- miniKanren with a first-order representation of the search space☆17Updated last year
- ☆37Updated last year
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated last month
- A categorical semantics library in Agda.☆16Updated 6 years ago
- ☆62Updated 6 years ago
- Relational interpeter combining miniKanren-in-miniKanren and Scheme-in-miniKanren☆19Updated 6 months ago
- ☆59Updated 11 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆23Updated 9 years ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆66Updated 4 years ago
- A library for non-deterministically parsing natural language expressions into a structured form.☆18Updated 2 years ago
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated last year
- An extended typed Lambda Calculus☆21Updated last year
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆21Updated 9 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- miniKanren variant with a functional syntax, expressing disjunction via pattern matching☆17Updated 5 years ago