[m-dev.] for review: tuples [1]

[Peter Schachte]

On Fri, Aug 11, 2000 at 07:28:04PM +1000, Fergus Henderson wrote:
> Well, personally, I want to have my cake and eat it too: I would like
> efficient working tuples AND in addition I want to be able to write
> instance declarations that will handle tuples of arbitrary arity.

Can you give an example of what you want to be able to do?

If constructing and deconstructing a tuple requires copying all or most of the
data, why would you ever want to do it?  As long as you accept defeat on the
issue of taking pointers into terms, I can't see how you could ever have
efficient decomposable tuples.  So why not just use lists?

-- 
Peter Schachte <schachte at cs.mu.OZ.AU>  I'm not afraid of dying, I just don't
http://www.cs.mu.oz.au/~schachte/      want to be there when it happens.
Phone:  +61 3 8344 9166                    -- Woody Allen 
Fax:    +61 3 9348 1184                
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------