HaloO,
Autrijus Tang wrote:
Yes, I'm aware of Theta's static where clauses, but Perl 6's where
clause is much more dynamic and almost always undecidable.
I know, but what does that buy the programmer? I see a type system
as support of a declarative programming style. Thus the dynamic part
of t
On Tue, Aug 02, 2005 at 12:49:06PM +1000, Brad Bowman wrote:
> > 1. Asserted
> >
> > The usual case for Perl 6 functions, due to its default "Item"
> > signature for parameters. In the example below, I assume that ::*
> > cannot
> > be changed freely to do away with ::*IO at runtime.
> 1. Asserted
>
> The usual case for Perl 6 functions, due to its default "Item"
> signature for parameters. In the example below, I assume that ::* cannot
> be changed freely to do away with ::*IO at runtime. (If it could, then
> assertions won't be of much use in general.)
>
On Fri, Jul 29, 2005 at 06:36:45PM +0200, "TSa (Thomas Sandla�)" wrote:
> you wrote:
> >Interested readers can consult Manfred Widera's similar work for Scheme,
> >in his "Complete Type Inference in Functional Programming" paper.
>
> Uih, you call a 300 page book a paper? I'm impressed.
Well, it'
HaloO Autrijus,
you wrote:
Interested readers can consult Manfred Widera's similar work for Scheme,
in his "Complete Type Inference in Functional Programming" paper.
Uih, you call a 300 page book a paper? I'm impressed. If that
is the thing you read between tramp stations here's one of my
favo
