Can someone explain to me why:
(1) The GHC installation instructions state that you should install Cygwin
before installing GHC on Windows,
but
(2) GHC seems to ship with its own versions of many of the Cygwin utilities
(including perl and the Cygwin dll) ?
On my Windows 2000 machine, this
Im proceeding with basic exploratory tests witrh HaXml (1.02, winhugs feb 2001)
the pretty print return the closing on the next line, like
Person-XML
Name
string
where i expect
Person-XML
Name
string
what am i doing wrong ?
( the call is like
Taesch, Luc [EMAIL PROTECTED] writes:
the pretty print return the closing on the next line, like
Person-XML
Name
string
where i expect
Person-XML
Name
string
My guess is that HaXML doesn't validate (using the DTD) or simply
ignores it for pretty
CALL FOR PAPERS
Semantics, Applications and Implementation of Program Generation (SAIG'01)
PLI Workshop, September 6th, 2001.
(EXTENDED DEADLINE: June 1st, 2001)
Program generation has the prospect of being an integral part
We are pleased to announce a new release of the nhc98 compiler, and
in particular its facilities (both brand new and improved old stuff)
for tracing and debugging Haskell programs - the Hat system.
The basic nhc98 compiler version 1.04 is mostly a bugfix release
(details listed at the bottom of
Hello,
Iwould like to use the file stack.hs wich is provided
with Hugs 98 but the following message errors display:
"Haskell98 does not support restricted type
synonyms"
Can you explain me why and how I can load stack.hs
?
Thanks in advance
Mon, 21 May 2001 20:51:37 +0200, Mickaël GAUTIER [EMAIL PROTECTED] pisze:
I would like to use the file stack.hs wich is provided with Hugs 98 but
the following message errors display:
Haskell98 does not support restricted type synonyms
Can you explain me why and how I can load stack.hs ?
I'm having trouble
understanding recursive types (e.g., as described in Functional Programming
with Overloading and Higher-Order Polymorphism by
Jones.
He gives as an
example
data Mu f = In
(f (Mu f))
data NatF s =
Zero | Succ s
type Nat = Mu
NatF
Among the things I
don't get
David Bakin writes:
| I'm having trouble understanding recursive types (e.g., as described in
| Functional Programming with Overloading and Higher-Order Polymorphism by
| Jones.
|
| He gives as an example
|
|
| data Mu f = In (f (Mu f))
|
| data NatF s = Zero | Succ s
| type
Hi Mark,
isSorted xs = and (zipWith (=) xs (tail xs))
In other words: When is a list xs sorted? If each element in xs is
less than or equal to its successor in the list (i.e., the corresponding
element in tail xs).
That's right ... under cbn! At the same time David's version with
10 matches
Mail list logo
