Re: [racket-dev] `take' argument order

2011-06-08 Thread Eli Barzilay
About a minute ago, Robby Findler wrote: Just on general principle, I think that making take in lazy match take in regular racket is more important than matching Haskell, but I don't really have a firm enough grasp on the details to have a strong opinion either way on the below. [Yes, that's

Re: [racket-dev] `take' argument order

2011-06-08 Thread Eli Barzilay
10 minutes ago, Robby Findler wrote: On Wed, Jun 8, 2011 at 8:55 AM, Eli Barzilay e...@barzilay.org wrote: [Yes, that's true regardless.  If `take' in plain `racket' stays as is, then eventually the one in lazy will need to change.  It just happened to be the first thing that made me look

Re: [racket-dev] `take' argument order

2011-06-08 Thread Matthew Flatt
I like the current order of `take' because it's consistent with Racket's dominant convention. To the list of advantages, I would add consistent with `take' in SRFI-1. It seems strange to make `take' less compatible with SRFI-1's `take' toward the end of making `take' be more compatible with

Re: [racket-dev] `take' argument order

2011-06-08 Thread Eli Barzilay
Three minutes ago, Matthew Flatt wrote: I like the current order of `take' because it's consistent with Racket's dominant convention. To the list of advantages, I would add consistent with `take' in SRFI-1. (Yeah, that was implicit in the original reason...) It seems strange to make `take'

Re: [racket-dev] `take' argument order

2011-06-08 Thread Eli Barzilay
A few seconds ago, Matthew Flatt wrote: At Wed, 8 Jun 2011 10:21:18 -0400, Eli Barzilay wrote: In any case, I do take compatibility as a priority, so I'm suggesting allowing both orders for this case. You also mentioned disallowing improper lists as a related change, which could be

Re: [racket-dev] `take' argument order

2011-06-08 Thread Robby Findler
On Wed, Jun 8, 2011 at 9:21 AM, Eli Barzilay e...@barzilay.org wrote: In any case, I do take compatibility as a priority, so I'm suggesting allowing both orders for this case. I did not mention this (remaining silent in response to your comment with the word 'flame' in the original message),

Re: [racket-dev] `take' argument order

2011-06-08 Thread Eli Barzilay
10 minutes ago, Robby Findler wrote: On Wed, Jun 8, 2011 at 9:21 AM, Eli Barzilay e...@barzilay.org wrote: In any case, I do take compatibility as a priority, so I'm suggesting allowing both orders for this case. I did not mention this (remaining silent in response to your comment with

Re: [racket-dev] `take' argument order

2011-06-08 Thread Eli Barzilay
6 minutes ago, Stephen Bloch wrote: On Jun 8, 2011, at 9:55 AM, Eli Barzilay wrote: ... the justification for the argument order in Haskell is not laziness but its implicit currying -- so of course it shouldn't be a reason to make lazy racket follow it.] Another justification for

Re: [racket-dev] `take-until' etc

2011-06-08 Thread Sam Tobin-Hochstadt
Me too. I like `take-until' as well. 2011/6/8 Jay McCarthy jay.mccar...@gmail.com: I'd really like #:unless as well iPhoneから送信 On 2011/06/08, at 9:21, Eli Barzilay e...@barzilay.org wrote: Anyone seconds this? And if so, then maybe for-loops should have an `#:unless' too? (I know that

Re: [racket-dev] `take' argument order

2011-06-08 Thread Vincent St-Amour
At Wed, 8 Jun 2011 10:15:58 -0500, Robby Findler wrote: On Wed, Jun 8, 2011 at 9:21 AM, Eli Barzilay e...@barzilay.org wrote: In any case, I do take compatibility as a priority, so I'm suggesting allowing both orders for this case. I did not mention this (remaining silent in response to

Re: [racket-dev] `take' argument order

2011-06-08 Thread Matthias Felleisen
Take from the sequence of primes the first five numbers and add them up. This is at most slightly mangled :-) On Jun 8, 2011, at 11:38 AM, Eli Barzilay wrote: 6 minutes ago, Stephen Bloch wrote: On Jun 8, 2011, at 9:55 AM, Eli Barzilay wrote: ... the justification for the argument