Re: Complete type inferencing

2005-08-08 Thread TSa (Thomas Sandlaß)
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

Re: Complete type inferencing

2005-08-01 Thread Autrijus Tang
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.

Re: Complete type inferencing

2005-08-01 Thread Brad Bowman
> 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.) >

Complete type inferencing

2005-07-29 Thread Autrijus Tang
On Fri, Jul 29, 2005 at 04:59:21AM +0800, Autrijus Tang wrote: > However, my intuition is that a soft-typed system, with clearly defined > dynamic parts translated to runtime coerce and dependent types, that can > work exactly as Perl 5 did at first, but provide sensible inferencing > and compile-t