[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

This page is part of the web mail archives of SRFI 67 from before July 7th, 2015. The new archives for SRFI 67 contain all messages, not just those from before July 7th, 2015.

*To*: srfi-67@xxxxxxxxxxxxxxxxx*Subject*: Re: vector compare*From*: Sebastian Egner <sebastian.egner@xxxxxxxxxxx>*Date*: Fri, 10 Jun 2005 10:13:45 +0200*Delivered-to*: srfi-67@xxxxxxxxxxxxxxxxx*In-reply-to*: <rbT1CB.A.uAF.Q-SqCB@rotkohl>

>

> > This is in contrast to the point of view we have taken for this SRFI:

> > There are two abstract data types called VECTOR and LIST, where

> > VECTOR is specified by a SIZE procedure and a REF procedure

> > (e.g. constant-time random access finite-length sequences) and

> > LIST is specified by procedures EMPTY?, HEAD and TAIL (e.g.

> > unbounded finite stacks).

>

> But you're omitting a detail here, which is that REF is specified in

> terms of natural numbers, which have inductive structure, which could

> be used to justify choosing the list order. Of course, this is

> far-fetched, but that, to my mind, also holds for vector comparison

> you picked.

**Follow-Ups**:**Re: vector compare***From:*Michael Sperber

- Prev by Date:
**Re: Optional arguments at the beginning** - Next by Date:
**Re: vector compare** - Previous by thread:
**Re: vector compare** - Next by thread:
**Re: vector compare** - Index(es):