On Thu, Oct 16, 2008 at 10:37:41PM +0200, Eirik Berg Hanssen wrote:
: [EMAIL PROTECTED] writes:
:
: > -C<< infix: >>, sequential junctional and operator
: > +C<< infix: >>, sequential junctional and operator
: >
: > -EXPR where EXPR where EXPR ...
: > +EXPR also EXPR also EXPR ...
: >
[EMAIL PROTECTED] writes:
> -C<< infix: >>, sequential junctional and operator
> +C<< infix: >>, sequential junctional and operator
>
> -EXPR where EXPR where EXPR ...
> +EXPR also EXPR also EXPR ...
>
> Can be used to construct ANDed patterns with the same semantics as
> C<< infix:<
On Thu, Oct 16, 2008 at 02:56:28PM +1100, Timothy S. Nelson wrote:
> Hi all. I'm working on the code for trees that I keep talking about,
> and I have code that somewhat resembles the following:
>
> role Tree::Node does Array {
> has Tree::Node @!children handles ;
> }
>
> The
On Thu, Oct 16, 2008 at 09:34:33AM -0700, [EMAIL PROTECTED] wrote:
: rename infix: to infix:
The rationale for changing this, by the way, is that (in English)
A where B where C
tends to imply right-to-left evaluation of preconditions, whereas:
A also B also C
tends to imply left-to-rig
Author: larry
Date: Thu Oct 16 09:34:30 2008
New Revision: 14597
Modified:
doc/trunk/design/syn/S03.pod
Log:
rename infix: to infix:
Modified: doc/trunk/design/syn/S03.pod
==
--- doc/trunk/design/syn/S03.pod(
