miniKanren/miniKanren

Stars
350
Rank 118,523 (Top 3 %)
Language
Scheme
License
MIT License
Created over 11 years ago
Updated about 6 years ago

miniKanren/miniKanren

miniKanren

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Canonical miniKanren implementation

miniKanren

Canonical miniKanren implementation.

Implements the language described in the paper:

William E. Byrd, Eric Holk, and Daniel P. Friedman. miniKanren, Live and Untagged: Quine Generation via Relational Interpreters (Programming Pearl). To appear in the Proceedings of the 2012 Workshop on Scheme and Functional Programming, Copenhagen, Denmark, 2012.

CORE LANGUAGE

Logical operators:

== fresh conde

Interface operators:

run run*

EXTENDED LANGUAGE

Constraint operators:

=/= symbolo numbero absento

TheReasonedSchemer

Code from 'The Reasoned Schemer' (MIT Press, 2005) by Daniel P. Friedman, William E. Byrd and Oleg Kiselyov.

Racket-miniKanren

Canonical miniKanren implementation in Racket

simple-miniKanren

Simple miniKanren, with only ==, fresh, and conde. A good starting point for exploratory hacking.

sokuza-kanren

Oleg Kiselyov's minimal implementation of logic programming

miniKanren_org-website

Files for the miniKanren.org website. If you would like to update the site, please do so and send a pull request!