named sub-expressions, n-ary functions, things and stuff

2006-11-13 Thread Darren Duncan
All, As I've continued to develop my Perl-implemented and integratable RDBMS, a number of aspects have inspired thought for posible improvements for the Perl 6 language design. For context, the query and command language of my RDBMS intentionally overlaps with Perl 6 as much as reasonable; t

Re: named sub-expressions, n-ary functions, things and stuff

2006-11-13 Thread Mark J. Reed
On 11/13/06, Darren Duncan <[EMAIL PROTECTED]> wrote: - There are no Undef or NaN etc values or variables. A RDBMS language with no "null" would seem to be problematic.. although i guess you could just use 1-tuples where the empty tuple is treated as null. -- Mark J. Reed <[EMAIL PROTECTED]>

Re: generic ordinal-relevant operators

2006-11-13 Thread TSa
HaloO, Darren Duncan wrote: For the record, my preference is to have the generics be the shortest, [==,!==,<=>,<,>,<=,>=], and use [+,~] prefixes for Num or Str casting versions. And lengthen the bit-shift operators to use thin-tailed arrowheads as you suggested. I like this proposal for its

Re: how to change the type of objects

2006-11-13 Thread TSa
HaloO, Darren Duncan wrote: What is the point of declaring a type as Rectangle, with those limitations, if you are going to mutate it into not being a Rectangle. There are three issues: 1) the subtyping relation 2) the preservation of object identity 3) the mutating add_vertex method Callin

Re: named sub-expressions, n-ary functions, things and stuff

2006-11-13 Thread mark . a . biggar
And you may be forced to deal with NaN and Inf values if you are storing raw binary float values as they are built into the bit patterns. -- Mark Biggar [EMAIL PROTECTED] [EMAIL PROTECTED] [EMAIL PROTECTED] -- Original message -- From: "Mark J. Reed" <[EMAIL PROT

Re: generic ordinal-relevant operators

2006-11-13 Thread Smylers
TSa writes: > Darren Duncan wrote: > > > For the record, my preference is to have the generics be the > > shortest, [==,!==,<=>,<,>,<=,>=], and use [+,~] prefixes for Num or > > Str casting versions. And lengthen the bit-shift operators to use > > thin-tailed arrowheads as you suggested. > > I l

[svn:perl6-synopsis] r13475 - doc/trunk/design/syn

2006-11-13 Thread larry
Author: larry Date: Mon Nov 13 10:14:35 2006 New Revision: 13475 Modified: doc/trunk/design/syn/S03.pod Log: Added missing generic boolean comparisons as noted by dduncan++. Modified: doc/trunk/design/syn/S03.pod ==

Re: generic ordinal-relevant operators

2006-11-13 Thread Jonathan Lang
Smylers wrote: Bzzzt, wrong language! But Perl isn't an orthogonal language, it's a "diagonal" language. http://www.oreilly.com/catalog/pperl2/excerpt/ch01.html In the section quoted, it was indicated that "orthogonal" and "diagonal" are being used to mean "minimalist" and "loaded with spec

Re: named sub-expressions, n-ary functions, things and stuff

2006-11-13 Thread Darren Duncan
At 11:00 AM -0500 11/13/06, Mark J. Reed wrote: On 11/13/06, Darren Duncan <[EMAIL PROTECTED]> wrote: - There are no Undef or NaN etc values or variables. A RDBMS language with no "null" would seem to be problematic.. although i guess you could just use 1-tuples where the empty tuple is treate

Re: named sub-expressions, n-ary functions, things and stuff

2006-11-13 Thread Smylers
Darren Duncan writes: > 1. I'm not sure if it is possible yet, but like Haskell et al ..., it > should be possible to write a Perl 6 routine or program in a pure > functional notation or paradigm, such that the entire routine body is > a single expression, but that has named reusable sub-expressio

[svn:perl6-synopsis] r13476 - doc/trunk/design/syn

2006-11-13 Thread larry
Author: larry Date: Mon Nov 13 17:09:46 2006 New Revision: 13476 Modified: doc/trunk/design/syn/S03.pod Log: Add infix min and max as form of "||" to enable meta mods like min= or »max« Modified: doc/trunk/design/syn/S03.pod ===

Re: named sub-expressions, n-ary functions, things and stuff

2006-11-13 Thread Darren Duncan
At 11:24 PM + 11/13/06, Smylers wrote: Darren Duncan writes: > 1. I'm not sure if it is possible yet, but like Haskell et al ..., it should be possible to write a Perl 6 routine or program in a pure functional notation or paradigm, such that the entire routine body is a single expression