On Feb 10, 2006, at 11:09 AM, Colin Paul Adams wrote:

Is there any Haskell code around that can interpret combinatory logic expressions?

Humm. That's kind of a broad question. I've written a shell for interpreting the pure untyped lambda calculus which has definitions for Turner's Combinators. You can get the darcs repo here: http://www.eecs.tufts.edu/~rdocki01/lambda/ you will also need http://www.eecs.tufts.edu/~rdocki01/shell/ http://www.eecs.tufts.edu/~rdocki01/shell-readline/ Or... you can play with it on the haskell IRC channel by using the '@lam' lambdabot command. Its hard to know if this will meet your needs without knowing more. What are you trying to do? Rob Dockins Speak softly and drive a Sherman tank. Laugh hard; it's a long way to the bank. -- TMBG