[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Chicken-hackers] substring function and bounds checks
From: |
John Cowan |
Subject: |
Re: [Chicken-hackers] substring function and bounds checks |
Date: |
Wed, 6 Feb 2013 00:37:56 -0500 |
User-agent: |
Mutt/1.5.20 (2009-06-14) |
.alyn.post. scripsit:
> I certainly appreciate this design principle, but there is just no
> explaining DSSSL using the above philosophy. I find the interaction
> between #!rest and #!key much more sensible in Python, which forbids
> every potentially ambiguous case and therefor has much more
> consistent behavior with the various combinations available.
DSSSL was cloning Common Lisp here, and Common Lisp has never given
a single, double, short, or long damn for consistency.
--
John Cowan <address@hidden>
http://www.ccil.org/~cowan
.e'osai ko sarji la lojban.
Please support Lojban! http://www.lojban.org
Re: [Chicken-hackers] substring function and bounds checks, Moritz Heidkamp, 2013/02/05
Re: [Chicken-hackers] substring function and bounds checks, Felix, 2013/02/05
Re: [Chicken-hackers] substring function and bounds checks, Jim Ursetto, 2013/02/05