ell
(in fact, you can use type classes to make it look even slicker).
Nick
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Donald Bruce Stewart
Sent: 19 January 2005 02:51
To: Vivian McPhail
Cc: haskell@haskell.org
Subject: Re: [Haskell] Running ha
vivian.mcphail:
>
>Dear All,
>I have a parser which has entries for each word, such as:
>
>ate = s \ np / np : ^x y.did(eat y x);
>
>so each word has a type (s \ np / np) and a semantics (the
>lambda term ^x y.did(eat y x)).
>
>Currently I parse the semantics into lamb
Dear All,
I have a parser which has entries for each word, such
as:
ate = s \ np / np : ^x y.did(eat y
x);
so each word has a type (s \ np / np) and a semantics (the
lambda term ^x y.did(eat y x)).
Currently I parse the semantics into lambda terms and use my
own lambda-interpreter
