HaloO,
John M. Dlugosz wrote:
Then the declaration
my ::T $x = whatever;
should use the exact same generic mechanism! At worst, it needs
I would expect that this works by binding ::T to the type of whatever.
my Any ::T $x = whatever;
Any here is optional.
and it will introduce
In S02 it is writ, The key type of a hash may be specified as a shape
trait--see S09.
However, S09 is rather brief on hashes, and although it shows using a type
inside the curlies, it never talks about shape traits or anything else.
Am I do understand that it pretty much does all the same
HaloO,
John M. Dlugosz wrote:
More globally, nothing is said much about parameters to types.
It shows an example like Array[of=T] but never discusses the
syntax of defining parameterized types or anything. Is there
a paper or discussion on that I could read?
Essentially the direct
HaloO,
Jonathan Worthington wrote:
Miller, Hugh wrote:
Was that private communication or on another mailing list?
What is the type of $b? Well, we can't actually infer that because foo
might be:
sub foo() {
$OUTER::a = oh hi, i iz not int!
}
That should be $CALLER::a because
TSa wrote:
Jonathan Worthington wrote:
Miller, Hugh wrote:
Was that private communication or on another mailing list?
It was also sent to perl6-language, through I was on the To or Cc line
too, so I guess that's how I got it but the list, somehow, didn't. Not
sure why the original message I
Miller, Hugh wrote:
What about the type support (system) one sees in ML ? (e.g., the way it
assigns automatically types can be assigned, does not require specific
types when they are not needed, flags incompatibilities, etc.) Do those
things not fit well with Perl's approaches and aims ?
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On
Behalf Of Mark J. Reed
Sent: Monday, April 14, 2008 2:05 PM
To: Jonathan Worthington
Cc: David Green; Perl6
Subject: Re: Idea: infer types of constants
On Mon, Apr 14, 2008 at 2:32 PM, Jonathan Worthington
my
John M. Dlugosz wrote:
Moritz Lenz moritz-at-casella.verplant.org |Perl 6| wrote:
John M. Dlugosz wrote:
I posted my current work at
http://www.dlugosz.com/files/specdoc.pdf
and .odt.
3.1.1 Normalization uses a constant without a sigil - is that really
allowed?
Yes, it's in
HaloO,
John M. Dlugosz wrote:
This needs to be fleshed out. Decisions need to be made.
Anyone want to discuss it with me?
I want to. But give me time. Meanwhile you could read
e.g. http://www.dcs.shef.ac.uk/~ajhs/classify/index.html.
This deals with F-bounded polymorphism in a tutorial
It would behoove @Larry to examine the optional type constraints
system proposed for Javascript:TNG (see link from firefox.com
developers page). I therefore assume that they have done so, but
others would benefit by doing likewise. :)
On 4/15/08, TSa [EMAIL PROTECTED] wrote:
HaloO,
John M.
I apologize for the vagueness; I was away from browser when I sent
that. Go to http://www.ecmascript.org for the nitty gritty on
ECMAScript 4th Edition, a.k.a. JavaScript 2, which is what I was
talking about. White papers, specs, reference interpreter.
The link from the Firefox developers page
Aloha!
On behalf of the Parrot team, I'm proud to announce Parrot 0.6.1
Bird of Paradise. Parrot (http://parrotcode.org/) is a virtual machine aimed
at running all dynamic languages.
Parrot 0.6.1 can be obtained via CPAN (soon), or follow the
download instructions at
Mark J. Reed wrote:
It would behoove @Larry to examine the optional type constraints
system proposed for Javascript:TNG (see link from firefox.com
developers page). I therefore assume that they have done so, but
others would benefit by doing likewise. :)
Could you be a little more specific
Strings, arrays, lists, sequences, captures, and tree nodes can all be pattern
matched by regexes or by signatures more or less interchangably.
How can captures me matched by regexes? Does this mean that there is really an
isomorphism between Signatures and Regexes?
14 matches
Mail list logo
