Home > Archive > Scheme > May 2004 > KANREN a declarative logic programming system, embedded in a pure
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
KANREN a declarative logic programming system, embedded in a pure
|
|
|
|
I saw a link to this on Lambda the ultimate.
This may be of interest since Daniel Friedman is one of the deveopers.
http://kanren.sourceforge.net/
"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.
Applications of the system range from expert systems to polymorphic type inference and overloading resolution, to model checking and theorem proving. The system can be used as a meta-logic system.
KANREN works on any computer platform for which a Scheme implementation exists (from PalmPilot and iPAQ to Unix/Linux/Winxx/Mac workstations and servers to MindLego bricks). The system can be compiled or interpreted. Being essentially a Scheme library, KA
NREN can interact with the user through any graphical or command-line interface provided by the host Scheme implementation"
|
|
|
|
|