Re: [Scheme-reports] Proposed new SRFI for immutable lists

[Alex Shinn <alexshinn@x>]

On Wed, Sep 3, 2014 at 2:00 PM, Kevin Wortman <kwortman@x> wrote:

Some initial thoughts:

Should these procedures take SRFI 114 comparators instead of equality predicates?

Are cycles actually possible in strict immutable structures? When you create a head node, there's no way for it to have a circular link to a tail node that doesn't exist yet.

Yes, if you provide implementation support for it,

see http://docs.racket-lang.org/reference/shared.html

Also for lazy data structures see http://www.haskell.org/haskellwiki/Tying_the_Knot,

for which I have a Scheme version lying around somewhere.

Personally I am fond of first, second, etc.; I think they are more readable than car, cadr, etc.

At least remove the (scheme cxr) equivalents.

The immutable set data structures I have in mind do set-theoretic operations in O(n) time, though constructing them from an unordered list is O(n log n).

We should just remove the lset equivalents - that's what SRFI 113 is for.

What about iqq (quasiquote) in addition to iq?

iphone seems to be missing.

-- 

Alex

_______________________________________________
Scheme-reports mailing list
Scheme-reports@x
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports