Re: Representing cyclic data structures efficiently in Haskell

2003-07-08 Thread John O'Donnell
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

Re: Hugs Humor

2003-07-08 Thread Jon Fairbairn
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

Re: Representing cyclic data structures efficiently in Haskell

2003-07-08 Thread C.Reinke
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

Re: Hugs Humor

2003-07-08 Thread Andrew J Bromage
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