webyrd / tree-automata
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
- Normalization-by-evaluation in miniKanren☆24Updated 2 years ago
- software archaeology of reflective towers of interpreters☆15Updated 5 months ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- miniKanren with a first-order representation of the search space☆16Updated 7 months ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- miniKanren variant with a functional syntax, expressing disjunction via pattern matching☆16Updated 4 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- Concatenative relational interpreter in miniKanren☆22Updated 9 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- miniKanren implementation of ' Declarative semantics for functional languages: compositional, extensional, and elementary' by Jeremy Siek…☆14Updated 6 years ago
- This github repository hosts the code used within my thesis work and my last publication.☆12Updated 7 years ago
- A prototype of soft contract verification for an untyped functional language☆34Updated 3 years 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
- A metalanguage for creating sophisticated DSLs in Racket.☆30Updated last week
- Racket bindings for Z3☆24Updated 5 years ago
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated 8 months ago
- Prolog-Style Meta-Interpreters in miniKanren☆31Updated this week
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆21Updated 10 years ago
- CLP(SMT) on top of miniKanren☆35Updated 3 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆15Updated last year
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- an implementation of a microKanren(-like language) in miniKanren☆26Updated 10 years ago
- Kanren with databases☆43Updated 7 months ago
- ☆12Updated 9 months ago
- Racket bindings for Z3☆19Updated 12 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- A Scala-style magic function application form☆43Updated 2 years ago