webyrd / relational-interpreter-with-matchLinks
Relational Scheme interpreter, written in miniKanren, with Scheme pattern matcher
☆11Updated 10 years ago
Alternatives and similar repositories for relational-interpreter-with-match
Users that are interested in relational-interpreter-with-match are comparing it to the libraries listed below
Sorting:
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- microkanren in sml☆26Updated 10 years ago
- Clojure transducers in a typed setting, in Haskell☆55Updated 10 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- microKanren sagittarius/larceny☆11Updated 10 years ago
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Updated 5 years ago
- Code, wiki, and resources for the weekly miniKanren uncourse☆52Updated 10 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.☆23Updated 6 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- An implementation of miniKanren in Haskell☆78Updated 12 years ago
- higher order dependently typed logic programing☆173Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A prolog interpreter written in Haskell.☆62Updated 10 years ago
- The Ntha Programming Language☆92Updated 8 years ago
- TODO☆23Updated 9 years ago
- The Mechanization of Standard ML☆73Updated 2 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- A purely functional, dynamically typed, parallel evaluated Lisp-like programming language☆35Updated 9 years ago
- ☆10Updated 9 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- ☆21Updated 8 years ago
- Epic - a Supercombinator Compiler☆65Updated 10 years ago