| Lolli (logic programming) | |
| ? | |
| ? | |
| ? Josh Hodas <hodas@saul.cis.upenn.edu> ? | |
| ftp://ftp.cis.upenn.edu/pub/Lolli/Lolli-07.tar.Z. | |
|
Lolli is an interpreter for logic programming based
on linear logic principles.
Lolli can be viewed as a refinement of the the Hereditary Harrop formulas of Lambda-Prolog. All the operators (though not the higher order unification) of Lambda-Prolog are supported, but with the addition of linear variations. Thus a Lolli program distinguishes between clauses which can be used as many, or as few, times as desired, and those that must be used exactly once. | |
| ML | |
| November 8th, 1992 |
category: logic programming languages summary, or expanded.
Please send updates to free-compilers@idiom.com
The HTML is maintained by David Muir Sharnoff and the entries themselves are currently maintained by Bryan Miller.
Copyright (c) 1992-1998 David Muir Sharnoff, All Rights Reserved
Copyright (c) 1994-1996, Steven Allen Robenalt, All Rights Reserved