works, but regular expressions are normally implemented using finite automata, so the input size should be immaterial. Gregory Woodhouse[EMAIL PROTECTED]"Judge a man by his questions not his answers." --Voltaire ___
Haskell-Cafe mailing li
compiled as a whole,
much as a modern compiler might generate code capable of using the
possibilities of parallelism in the target architecture. But it seems
to me that a satisfactory theory ought to provide some insight into
how the pieces fit together, too. Just knowing how to generate
My knowledge of functional programming is pretty much limited to
Haskell, Scheme, and a smattering of Common Lisp. Are there languages
other than Haskell that explicitly use monads? How about "not so
explicitly"?
===
Gregory Woodhouse
[EMAIL PROTECTED]
"The universe is not
structures even
of any relevance to Haskell and FP? Well, in order to think it
through, I've been experimenting with the idea of reduction providing
the basic accessibility relation. That's why I've been asking
seemingly off-topic questions about lambda calculus and C-R (wel
-name) but
have yet to find an appropriate framework for modeling lazy
evaluation (much less infinite lists and comprehensions). Can anyone
point me in the right direction?
===
Gregory Woodhouse
[EMAIL PROTECTED]
"Nothing is as powerful than an idea
whose time has come."
