On Apr 10, 2008, at 1:20 PM, Brent Yorgey wrote:
This is true for any compiler that produces native binaries (as
opposed to certain languages which require a virtual machine...)
Unless, of course, it results in a dynamically linked binary, which
I'm pretty sure GHC doesn't support at all an
On Apr 4, 2008, at 11:31 AM, Loup Vaillant wrote:
I mean, could we calculate this equality without reducing
length ys to weak head normal form (and then to plain normal form)?
Yes. Suppose equality over Nat is defined something like:
Z == Z = True
S x == S y = x == y
x == y
From: Jake McArthur <[EMAIL PROTECTED]>
Date: February 13, 2008 7:04:49 PM CST
To: Felipe Lessa <[EMAIL PROTECTED]>
Subject: Re: [Haskell-cafe] existential types
On Feb 13, 2008, at 11:15 AM, Felipe Lessa wrote:
On Feb 13, 2008 2:41 PM, Jake McArthur <[EMAIL PROTECTED]>
Oops, I was hasty in typing those data definitions. They will not work
because they have no constructors. Sorry about that.
- Jake
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Let's try a different example. Let's start with a list designed to
hold numbers:
data NumericList a = Num a => [a]
Normally this would be fine. We can hold things like [1, 2, 3, 4, 5]
and [1.7, 5.3, 2.0, 99.1]. But what if we wanted to be able to hold
numbers with _different types_ in the
On Jan 26, 2008, at 12:20 PM, jia wang wrote:
Graphics/HGL/Key.hs:57:7:
Could not find module `Graphics.Win32':
it is a member of package Win32-2.1.1.0, which is hidden
You need to install the Win32 package.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Win32-2.1.0.0
-
On Jan 20, 2008, at 1:03 PM, Yitzchak Gale wrote:
Generating an infinite list from a random generator "burns up"
the generator, making it unusable for any further calculations.
That's what the split function is for. ^_^
- Jake
___
Haskell-Cafe mail
On Jan 10, 2008, at 1:57 PM, Achim Schneider wrote:
Now don't make me think of using par on a beowolf cluster of ps3's.
Never in my life have I _literally_ drooled over using a programming
abstraction.
- Jake___
Haskell-Cafe mailing list
Haskell-
On Dec 31, 2007, at 11:21 AM, Achim Schneider wrote:
Jake McArthur <[EMAIL PROTECTED]> wrote:
I disagree. It might be the case that the _contents_ of the data
structure are lazy, in which case I would say the relevant
constructor parameters should be made strict. As long as the
stru
On Dec 31, 2007, at 9:53 AM, Paul Johnson wrote:
I'd advise against trying to make your program stricter because you
might suddenly find yourself building an entire 6GB structure in
memory before traversing it, which would not be a Good Thing.
I disagree. It might be the case that the _cont
On Dec 31, 2007, at 6:50 AM, Cristian Baboi wrote:
On Mon, 31 Dec 2007 14:36:02 +0200, Joost Behrends <[EMAIL PROTECTED]
> wrote:
I forgot 2 things:
The distinction between '=' and '==' is much like in C, although
mixing
them up is not so dangerous like in C. ':=' and '=' like in Wirth
l
On Dec 30, 2007, at 12:32 PM, Joost Behrends wrote:
Thanks to both fast answers.
there remain problems with Jakes mail for me. This:
When you define datatypes, you are essentially defining a type-level
constructors on the left hand side and (value-level) constructors on
the right hand side.
On Dec 30, 2007, at 8:24 AM, Joost Behrends wrote:
For adapting hws (one of the reasons for me to be here, not many
languages have
a native web server) to Windows i must work on time. In System.Time
i found
data ClockTime = TOD Integer Integer
2 questions arise here: Does this define "TOD"
On Dec 28, 2007, at 10:18 PM, [EMAIL PROTECTED] wrote:
Quoting alex <[EMAIL PROTECTED]>:
I would like to do this:
class Foo t where
hi :: t -> Bool
class Foo t => Bar t where
hi x = True
This is arguably one of the most requested features in Haskell. The
only
reason
On Dec 19, 2007, at 6:25 PM, John Meacham wrote:
On Tue, Dec 18, 2007 at 01:58:00PM +0300, Miguel Mitrofanov wrote:
I just want the sistem to be able to print one of these
expressions !
Its this too much to ask ?
Yes, 'cause it means you want to embed almost all source code
into the
compil
On Nov 17, 2007, at 11:26 AM, Stefan O'Rear wrote:
The STG-machine was brilliant when it was designed, but times have
changed. In particular, indirect jumps are no longer cheap. Pointer
tagging has allowed STG to hobble into the 21st century, but really
the
air is ripe for a new abstract ma
201 - 216 of 216 matches
Mail list logo
