
Robin Green wrote:
On Mon, 07 Jul 2008 12:30:34 +0200 (CEST) Henning Thielemann
wrote: Actually the type system of Haskell is also logic programming. I have implemented a simple kind of logic programming using lazy peano numbers: http://darcs.haskell.org/unique-logic/
There is also Curry which is basically Haskell extended with features from logic programming. There you get to use ordinary values instead of having to use types. However, it seems that Curry's solution finding mechanism is built-in to the language and cannot be modified (e.g. for performance reasons) without modifying the language implementation. (I
Actually, I think it can: http://dblp.uni-trier.de/rec/bibtex/conf/iclp/HanusS98 Also more recently, I heard of a way to abstract a nondeterministic Curry value into its explicit search tree, which one can then traverse to one's own liking. Obviously, people on the Curry list will know more about the details... Ciao, Janis. -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de