I got question about why haskell insist to be a purely FL. I mean is
there any feature which is only support by pure?
I mean maybe the program is much easier to prove? Or maybe we can
cache some value for laziness.
Could anyone give me some more information about why haskell needs to be pure.
Tha
pe Parser tok a
zero::Parser tok ()
one :: Parser tok ()
...
On Nov 27, 2007 2:16 PM, Luke Palmer <[EMAIL PROTECTED]> wrote:
>
> On Nov 27, 2007 12:57 PM, Yu-Teh Shen <[EMAIL PROTECTED]> wrote:
> > i have seen the documents in
> > http://www.haskell.org/haske
i have seen the documents in
http://www.haskell.org/haskellwiki/Generalised_algebraic_datatype
but i can not run the following code on ghci
ex:
data Term x where
K :: Term (a -> b -> a)
S :: Term ((a -> b -> c) -> (a -> b) -> a -> c)
Const :: a -> Term a
(:@) :: Term (a -> b) ->
