With regret for raising sordid matters of implementations,...
I'm having some problems getting hbc to work on i386-redhat-linux.
(This has a 2.2.x kernel, and a hairy arrangement of libraries.)
Trying a staticly linked rh5.2 system from chalmers, it compiles
programs wonderfully, but they instant
Christian Maeder wrote:
>
> > But what type does the selector 'item' have? Phil, Mark and Jeff think:
> >
> > item :: Ord a => Tree a -> a
>
> This looks correct to me, too.
>
> If an order is needed to construct a tree, say a search tree, the very same
> order is (or may be) needed to s
Giuliano P Procida <[EMAIL PROTECTED]> asks:
> [Substring stuff snipped]
> Were you thinking of something like:
>
> class Stringy foo where
> toString :: foo -> String
> someop :: foo -> foo -> foo
> ...
>
> and just use Stringy foo => foo instead of String everywhere?
>
> Or just having
Simon Peyton-Jones wrote:
| Speak now or put up with overloaded selectors!
I don't know if this is of any interest to this discussion, but
the way I like interpreting a definition like:
data Eq a => Set a = MkSet [a]
is that every set knows how to compare its elements. Unfortunately,
this i
On Tue, May 18, 1999 at 02:22:55PM +0100, Keith Wansbrough wrote:
> Does anyone else think this is a brilliant idea that should be
> implemented? I float the idea in case (1) someone else is already
> doing this, or (2) someone else is interested in doing it. It
> shouldn't be too hard, but I do
> But what type does the selector 'item' have? Phil, Mark and Jeff think:
>
> item :: Ord a => Tree a -> a
This looks correct to me, too.
If an order is needed to construct a tree, say a search tree, the very same
order is (or may be) needed to select an item, e.g. by searching!
Chri
Simon Peyton-Jones <[EMAIL PROTECTED]> writes
> Interesting! Phil, Mark, and Jeff all have a different interpretation of
> how contexts on how data type declarations work than I did. So unless
> some other people chime in, I will therefore adopt their interpretation,
> since (a) I'm in the mi
In a thread "The Imperative strikes back?" on comp.lang.functional a
couple of weeks ago, Brian Rogoff <[EMAIL PROTECTED]> mentioned:
> [..] I really wish that
> the basic string handling capabilities in some FP languages were a bit
> better thought out. For example, I think in Haskell strings a
> Interesting! Phil, Mark, and Jeff all have a different interpretation of
> how contexts on how data type declarations work than I did. So unless
> some other people chime in, I will therefore adopt their interpretation,
> since (a) I'm in the minority and (b) it's not a big deal at all.
I ag
GHC's PackedString library goes some way towards providing
all this. However, a PackedString currently just records the
length of the sequence of bytes it points to, but could without
much incident record the byte offset to start at as well.
hth
--sigbjorn
Keith Wansbrough <[EMAIL PROTECTED]> w
Kevin
You might also find my paper "Bulk types with class" useful
http://research.microsoft.com/~simonpj/papers/collections.ps.gz
For a discussion of the type-class design space you might find
this helpful
http://research.microsoft.com/~simonpj/papers/multi.ps.gz
And don't forge
Folks,
Interesting! Phil, Mark, and Jeff all have a different interpretation of
how contexts on how data type declarations work than I did. So unless
some other people chime in, I will therefore adopt their interpretation,
since (a) I'm in the minority and (b) it's not a big deal at all.
But
12 matches
Mail list logo
