You are looking at historical revision 16994 of this page. It may differ significantly from its current revision.
A declarative applicative logic programming system.
Oleg Kiselyov and Dan Friedman, packaged for CHICKEN by Alex Shinn.
KANREN is a declarative logic programming system with first-class relations, embedded in a pure functional subset of Scheme. The system has a set-theoretical semantics, true unions, fair scheduling, first-class relations, lexically-scoped logical variables, depth-first and iterative deepening strategies. The system achieves high performance and expressivity without cuts.
For more information and example code, visit http://kanren.sourceforge.net.
This extension provides the kanren and mini-kanren modules.
- fixed test-dependencies
- Ported to CHICKEN 4
- There is now only a single setup file, also installs html [Thanks to Benedikt Rosenau]
- Added missing file (kanren-term.scm) [Thanks to Benedikt Rosenau]
- Initial release
KANREN is OpenSource, distributed under the MIT license.