Using the latest version of GHC downloaded from CVS, it's impossible to use
GHC to compile any .hcr files that it generates itself. The reason for this
is that, as per the CVS log for prelude/PrelNames.lhs, all Main modules now
contain a definition for $Main.main -- however, the External Core
| The paper has a strongly tutorial flavour, and comes complete with a
| prototype implementation that you can play with.
|
| Does the prototype implementation not support recursive lets?
|
| *Main tcs let fix = (\\f . f (fix f)) in fix
| Not in scope: `fix'
No it does not. As
G'day all.
On Tue, Jul 08, 2003 at 08:56:10AM +0100, Simon Peyton-Jones wrote:
No it does not. As the paper explains.
Serves me right for playing with the toy before I read the manual.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL
I took a quick skim through this -- not closely enough to follow all the
details but I still found some useful background understanding.
For me, it clarified slightly the role of types on the left and right hand
sides of a function arrow, which I've seen mentioned in passing but never
Is it possible replace the question mark in the following code in order to
make defaultMyType return a don't care value for b?
data MyType t = MyType { a :: Int, b :: t}
defaultMyType :: MyType
defaultMyType = MyType {a = 0, b = ?}
Cheers,
-- Andre
On Tue, 8 Jul 2003 23:16:33 -0300
Andre W B Furtado [EMAIL PROTECTED] wrote:
Is it possible replace the question mark in the following code in
order to make defaultMyType return a don't care value for b?
data MyType t = MyType { a :: Int, b :: t}
defaultMyType :: MyType
defaultMyType =
Hello to all,
I'm recently working on doing some atmospheric modelling for my PhD
thesis work and I've been writing parallel implementations in Java,
Ruby, and Haskell. I picked up Haskell as part of the LoTY project and
was especially impressed by how expressive and clean the code is. I've
Gordon James Miller wrote:
1 - Is there yet a standard, or at least commonly supported by hugs and
ghc, method for dealing with binary data.
2 - If not, is there a standard library that is used to manipulate
binary data. I've seen some references to some implementations but
given that
Hi Sarah,
On Mon, 2003-07-07 at 16:04, Sarah Thompson wrote:
What is the best way to represent cyclic data structures in Haskell?
Lists are trivial. Trees are trivial. But what if the thing you're
trying to represent is shaped like an electronic circuit, ...
...
How do people typically
On 2003-07-08 at 10:15+0200 Jerzy Karczmarczuk wrote:
If it's a _Rational_, surely you want it to be exactly the
same as you get for 31415926536%100?
No. If 'you' means concretely me, then no. Simply no.
Writing
pi = 3.1415926536 :: Rational
and expecting to continue the
What is the best way to represent cyclic data structures in Haskell?
There used to be some work on direct cyclic representations at UCL:
Dynamic Cyclic Data Structures in Lazy Functional Languages
Chris Clack, Stuart Clayman, David Parrott
Department of Computer Science, University
G'day all.
On Tue, Jul 08, 2003 at 01:06:23PM +0100, Jon Fairbairn wrote:
Unfortunately we don't have Real (in
libraries as far as I remember -- if you have a continued
fraction implementation of it, it ought to go to the
libraries list).
Not one, but TWO implementations! One using
12 matches
Mail list logo
