[Haskell] instance Bounded Double

2005-03-10 Thread Frederik Eaton
Shouldn't Double, Float, etc. be instances of Bounded? I've declared e.g. instance Bounded Double where minBound = -(1/0) maxBound = 1/0 in a module where I needed it and there doesn't seem to be any issue with the definition... Frederik -- http://ofb.net/~frederik/ __

[Haskell] Monad Unification

2005-03-10 Thread Dominic Steinitz
Can someone explain why this works? I would have expected an error when the typechecker tries to unify m with (StateT [Encoding] m). Dominic. *Codec.ASN1.BER> :t (tc absInteger (Primitive Universal 2 1 [0])) (tc absInteger (Primitive Universal 2 1 [0])) :: forall m e. (MonadError e m) => m Defa

Re: [Haskell] Binary Tree Traversal.

2005-03-10 Thread Stefan Holdermans
Paul, Are you sure this isn't homework? ;) data BinTree a = Nil | Node a (BinTree a) (BinTree a) inorder2 :: BinTree a -> [a] -> [a] inorder2 Nil xs = [] inorder2 (Node val b1 b2) xs = (inorder2 b1 (val:(inorder2 b2 (xs Review the case for []. What does the parameter xs represent? How should i

[Haskell] ICFP 2005 - Final Call for Papers

2005-03-10 Thread Benjamin C. Pierce
NEWS: * submission and formatting instructions are now available * the dates of the author response period have changed slightly - International Conference on Functional Programming (ICFP 2005)

[Haskell] DALT 2005 deadline extension: 18 March

2005-03-10 Thread baldoni
PLEASE ACCEPT OUR APOLOGIES IF YOU RECEIVE MULTIPLE COPIES Dear Colleague, Due to a large number of requests, we have extended the submission deadline for DALT 2005, the 3rd International Workshop on Declarative Agent Languages and Technologies to be held as part of the workshop progra

[Haskell] Binary Tree Traversal.

2005-03-10 Thread Paul Chen
data BinTree a = Nil | Node a (BinTree a) (BinTree a) inorder2 :: BinTree a -> [a] -> [a] inorder2 Nil xs = [] inorder2 (Node val b1 b2) xs = (inorder2 b1 (val:(inorder2 b2 (xs I want to be able to traverse across the binary tree in order and that is what I have so far. But somehow it always r

[Haskell] VLHCC'05 (Visual Languages and Formal Methods) - Paper deadline extended to 30 March (Visual Languages and Formal Methods)

2005-03-10 Thread Andy Schürr
Dear Colleagues, the combination of visual languages and formal methods is one of the traditional main topics of the IEEE VL/HCC conference series with a history of more than 20 years! It is still time to write a submission for this year's event (and to book a flight to Dallas ... ). Hope to see

Re: [Haskell] Embedded Systems

2005-03-10 Thread Malcolm Wallace
> >I'm wondering if there is any port of Haskell to Embedded > >systems. Any hint welcomed > > nhc has been used for a number of embedded projects. > > Btw, you can run GHC on a machine with 12M ram, but you badly need your > swap and it isn't pretty :) Many years ago, I ported Gofer (th

Re: [Haskell] Embedded Systems

2005-03-10 Thread Donald Bruce Stewart
goenzoy: >Hallo all, > >I m wondering if there is any port of Haskell to Embedded >systems. Any hint welcomed > >Ore the question in other form what is the smallest devices >for a running Haskell system and is possible to nhc has been used for a number of embedded projects. I

[Haskell] Embedded Systems

2005-03-10 Thread Gottfried F. Zojer
Hallo all, I m wondering if there is any port of Haskell to Embedded systems. Any hint welcomedOre the question in other form what is the smallest devices for a running Haskell system and is possible toglue it via Greencard.Thanks for any feedback Best regardsGottfried F. Zojer P.S.: Is Microsoft s