webyrd / tree-automataLinks
Tree-automata-based run-time type constraints for miniKanren
☆14Updated last year
Alternatives and similar repositories for tree-automata
Users that are interested in tree-automata are comparing it to the libraries listed below
Sorting:
- software archaeology of reflective towers of interpreters☆16Updated 2 weeks ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- Normalization-by-evaluation in miniKanren☆24Updated 2 years ago
- miniKanren with a first-order representation of the search space☆16Updated 10 months ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- miniKanren variant with a functional syntax, expressing disjunction via pattern matching☆16Updated 5 years ago
- miniKanren implementation of ' Declarative semantics for functional languages: compositional, extensional, and elementary' by Jeremy Siek…☆14Updated 7 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆32Updated 2 weeks ago
- Concatenative relational interpreter in miniKanren☆22Updated 10 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- A prototype of soft contract verification for an untyped functional language☆35Updated 4 years ago
- Prolog-Style Meta-Interpreters in miniKanren☆32Updated 3 months ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- A meta-language for adding Clojure-style shorthand function literals to arbitrary Racket languages.☆17Updated 8 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Kanren with databases☆43Updated 10 months ago
- This github repository hosts the code used within my thesis work and my last publication.☆12Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- A zipper library for Racket☆20Updated 9 years ago
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆21Updated 10 years ago
- An embedding of miniKanren in Shen.☆25Updated 10 years ago
- The (very) small kernel of the LaTTe proof assistant☆12Updated 3 months ago
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Updated 4 years ago
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated last year
- αProlog☆18Updated last year
- A Scala-style magic function application form☆43Updated 2 years ago