I'd not been following this discussion, but now it seems it's gotten to
instances of the Binary module. I figured I'd chime in briefly:
> thanks for your replies. i browsed thrugh the discussion on the
> libraries list, but it mainly seems to discuss if one should use bits or
> bytes in the bi
hello,
thanks for your replies. i browsed thrugh the discussion on the
libraries list, but it mainly seems to discuss if one should use bits or
bytes in the binary representation. not that this is not important (my
personal preference is to be fast rather then small, within reason), but
i wa
> > I know that we generally try to avoid specifying filename and directory
> > issues.
> > However, this is not really a filename issue, but a problem of relative
> > and absolute module names (wrt possibly several hierarchies). An "import
> > B" in module Test.A could mean either module B or modu
hello,
Olaf Chitil wrote:
...
I know that we generally try to avoid specifying filename and directory
issues.
However, this is not really a filename issue, but a problem of relative
and absolute module names (wrt possibly several hierarchies). An "import
B" in module Test.A could mean either mod
Ross Paterson wrote:
> On Fri, Mar 07, 2003 at 02:35:47PM +, Olaf Chitil wrote:
> > The simple reason why Hugs behaves so is that when searching a module it
> > *always* searches the current directory (* where the import was demanded
> > *) first. Only afterwards the paths set with the -P optio
When trying to make our Haskell tracer Hat work with Hugs (November
2002) I noticed that
* Hugs' implementation of hierarchical libraries differs from those
of ghc and nhc98, and
* Hugs' implementation choice makes it more restrictive than ghc/nhc98
A simple example:
There is module B in file
On Fri, Mar 07, 2003 at 02:35:47PM +, Olaf Chitil wrote:
> When trying to make our Haskell tracer Hat work with Hugs (November
> 2002) I noticed that
>
> * Hugs' implementation of hierarchical libraries differs from those
> of ghc and nhc98, and
> * Hugs' implementation choice makes it more
Pertinent to this thread (though perhaps overkill) is the work of Flajolet
et al on (fast) random generation of combinatorial structures for any
structure given as a context-free grammar, including Permutation.
In particular see
http://citeseer.nj.nec.com/flajolet93calculus.html
http://citeseer.nj
| (c) how do we derive instances of Binary?
If you guys can agree an interface that GHC, nhc and Hugs can all
support, I'll gladly do the 'deriving' stuff to make 'deriving Binary'
work for GHC. What's always inhibited me is that there isn't a single
agreed interface.
For most users, having a
hi there,
i am attending university of new orleans and for my
4501 class i picked haskell language to do my project.
rite now i am dealing with a lot of problems because
there are no books avaliable in bookstore on haskell,
and i dont find online information any helpfull. so
please help.
i am try
Prompted by my overlooking the GHC library URI code, may I suggest that a
reference to the GHC network library be added to the Libraries page at:
http://www.haskell.org/libraries/#xml
#g
---
Graham Klyne
<[EMAIL PROTECTED]>
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB
11 matches
Mail list logo