News for hackers. Stuff that matters.
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by xiaq on Sunday February 22, 2015 @12:19PM (#9090052)
This is the best part of Perl 6. I am not familiar with the terminology, but it seems "not just" gradual typing to me.

I always it puzzling that to avoid the tedious parts of static type systems, people throw away static checking entirely. As demonstrated by Perl 6 and other gradual typing systems, the whole dualism is imaginary.

I wish that the "runtime dynamicity with as much compile-time staticity as possible" idea will be the norm in the dynamic language community. I wish that someday when we talk about the days of 100% dynamicity with no static checking, we can remark that we have luckily passed that dark age.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tel on Sunday February 22, 2015 @02:57PM (#9090767)
From the static typing POV, the dualism is imaginary because gradual types are a perfectly acceptable and long known static type system. This is the real point of the "unityped" argument.
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by raiph on Sunday February 22, 2015 @06:10PM (#9091654)
Right. I think it's reasonable to say that all P6 code is statically typed, using nominal typing.[1]

I've not actually checked the following code yet. I just wanted to post it now and will return to update after I've tested this stuff tonight, but here's what I'm currently thinking:

* The Any type is the default value type.

* Built-in literals are automatically converted in to more specific value types at the time they are encountered by the compiler:

  my $a;   # $a contains an `(Any)` aka an undefined Any
  $a = 42; # puts an Int value into $a
* User defined literals and run-time string input are also supposed to be optionally automatically converted from an Any into a more specific type on assignment, but that's not yet implemented in the Rakudo P6 compiler.

* Optional explicit types improve type-checking on assignment:

  my Int      $d = 22/7; # compile-time error
* Not yet implemented but due to land soon:

  my Int(Any) $e = 22/7; # coerces 22/7 (a Rat, thus an Any)
                         # to 3 (an Int) at compile-time
* And for calls:

  sub add (Int $x, Int $y) { $x + $y }

  my     $a = 42;
  my     $b = '42';
  my Str $c = '42';

  add($a, $a); # OK
  add($a, $b); # run-time error?
  add($a, $c); # compile-time error
* Optional explicit types enable multisub dispatch:

  sub add (Int $x, Str $y) { say "oops!" }

  add($a, $c); # resolves to above sub at compile-time
               # says "oops!" at run-time
* P6 allows users to introduce "subsets". Subsets combine a base type (always static/compile-time) with additional constraint logic. The additional constraint may force the subset to become partially dynamic rather than solely static.

* Subsets can be applied in an assignment or signature:

  my enum Day ['Sun','Mon','Tue','Wed','Thu','Fri','Sat'];
  subset Weekday of Day where 'Mon' .. 'Fri';

  my Weekday $wd = Sat; # compile-time error

  sub foo (Weekday $wd) { ... }
* The additional constraint logic of a subset is a P6 "smart match" -- arbitrary code that accepts or rejects a specific value of the base type. In the Weekday subset above the constraint logic is `'Mon' .. 'Fri';`.

* If code analysis can deduce a finite set from the combination of base type and the additional constraint logic, then a compiler may choose to make the whole subset static and check and resolve calls and constrained assignments at compile-time. Otherwise the static part of a subset is checked at compile-time, which may lead to a particular call being among the candidates for a final dispatch, and then there may be a final round of call resolution and checking at run-time.

* Assignments and function calls that don't involve dynamic subsets, or where the compiler can eliminate them from consideration at compile-time, are type checked and dispatch resolved at compile-time.

* Methods are always dispatch resolved at run-time.

[1] http://en.wikipedia.org/wiki/Nominal_type_system

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tel on Sunday February 22, 2015 @07:12PM (#9091852)
The idea of trying to move subset types forward is interesting. Using an SMT solver [0] you can move quite a bit forward. Otherwise, generally, you're talking about associating a dictionary of pre- and post-conditions with a type (e.g., Weekday is a new nominal type isomorphic with Day, but it also has an associated dict containing checks that it's within Mon-Fri). Carrying that dict around has been well-solved by Haskell's typeclass compilation machinery and then it's just a matter of inserting the checks at the right times and not more often, I suppose.

[0] http://goto.ucsd.edu/~rjhala/liquid/haskell/blog/about/

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by raiph on Sunday February 22, 2015 @07:41PM (#9091945)
Perhaps you're aware that one of the biggest influences on P6 was Haskell and the 2005-2007 Audrey Tang / Pugs / lambdacamels era. Loads of crazy smart kids sharing wild thoughts with Larry, Damian etc. and writing the first P6 compiler in Haskell.
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tel on Sunday February 22, 2015 @11:24PM (#9092537)
I'm dimly aware, but that was prior to my time. I'm definitely able to see the influences, though! :)
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by cbd1984 on Monday February 23, 2015 @05:39AM (#9093564)
> the "unityped" argument.

Which is a gross, deliberate misunderstanding of how dynamic typing works.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tel on Monday February 23, 2015 @07:30AM (#9093904)
I'm sure that's not the case; instead, normally, it's an intentional distinction between the kind of things that "static types" are and the kind of things that "dynamic types" are. Merely because they share an informal descriptor doesn't make them comparable.

The unityped argument states only that any language admits a static type analysis regardless of whether it admits to it in polite company. From here gradual types are natural: just embed the unitype into a richer static type system.

If there's a dynamic type system (called a "tag" system sometimes to ensure distinctiveness) then that all lives after these types have run. It can be influenced by these types, but it is certainly more than merely syntactic/logical which gives it different correctness/behavior/UX properties.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by cbd1984 on Monday February 23, 2015 @11:00AM (#9094968)
No. Dynamic types are not tags. They're types, regardless of what static type zealots insist.
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tel on Monday February 23, 2015 @01:41PM (#9096045)
I'm not sure what you're arguing. If you're trying to equate "dynamic types" with "(static) types" then I'd like to see how you're doing that. If you're trying to refute that "dynamic types" are "tags" then I'd like to hear your definition of "tags" which you feel inappropriately characterizes "dynamic types".

If you're arguing something like "both 'static types' and 'dynamic types' are elements of a larger class of things called 'types'" then I'd be happy to talk about that given a meaningful definition of this larger class "types".

Generally, however, I find that most definitions of this larger class of "types" are difficult to operationalize. Due to that, please re-read my responses and mentally impute "static types" wherever I say "types". I try to be explicit about this, and it is my general MO, so if any disagreement or misunderstanding still remains then I'd be happy to talk about that as well.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by rurban on Tuesday February 24, 2015 @01:59PM (#9102720)
In the type community dynamic types are called tags, to contrast from static types which are thrown away after compile-time.

Types are not just "types", there exists myriads of interpretations and implementations. E.g. nominal vs structural, compile-time vs run-time, dynamic vs static, polynomial (HM) vs exponential (cartesian), sound vs unsound. Please get yourself accustomed to the type literature, or invent your own glossary, as perl usually does when it has no idea about prior art. In this case it has.

From the implementation POV tags are indices into types and used with primitives as tags, hence the name, reserved "bits", e.g. with 30bit intnums or the many free NaN tagging bits in doubles or normal class slots with multiword objects. They are carried along the lifetime of the variable, hence add critical run-time safety and inherent slowness.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by pekk on Sunday February 22, 2015 @12:57PM (#9090199)
I always find it puzzling that people throw away dynamic typing entirely. You can't make decisions about what's best for me based on rules of thumb like "as much static typing as possible," your use cases probably don't match mine if you don't understand why anyone would want dynamic typing.
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by mmphosis on Sunday February 22, 2015 @01:53PM (#9090472)
Time, random, user input, self-modifying self-compiling code, undetermined function results, ...

I agree that there are no absolute rules. A fixed system is boring, and often very inefficient depending how you look at it. Sure my system is static, but inside the black box there is a lot of "dynamism" that I can't change without a recompile. The development environment is dynamic. Writing code, creating the rules, and creating the locked down static types are all dynamic actions. There is no need for a separation between developer/user. User can set the rules, create the workflow, compile the code on the fly. There is no need for a separation between compile and run time.

GHC is itself written in Haskell (utilizing a technique known as bootstrapping), but the runtime system for Haskell, essential to run programs, is written in C and C−−.

I don't know much about C--, but C, what Haskell's runtime is written in, is fairly dynamic.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by maxlybbert on Sunday February 22, 2015 @11:11PM (#9092492)
http://www.cminusminus.org/ . It's meant as a compiler target, say, a portable assembly code.
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tome on Monday February 23, 2015 @09:24AM (#9094395)
Care to say a bit about your use cases that you consider inappropriate for static typing?
Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by sparkie on Sunday February 22, 2015 @03:13PM (#9090850)
The reason is simple: Using a statically typed language (particularly one with reflection capabilities), it's trivial to do pretty much anything a dynamic language is capable of doing without extra tooling, perhaps with just a bit more verbosity in code. On the other hand, attempting to simulate static typing with an entirely dynamic language doesn't happen without extra tooling around the compiler.

Even languages with strict type systems like Haskell don't entirely throw away dynamic typing. It has `unsafeCoerce` which can attempt to cast a value at runtime, and fail if it's not the right type like any dynamic language would. However, when combined with Data.Typeable, storing type information in addition to the values you're interested in allows you to turn `unsafeCoerce` into something much safer: `fromDynamic`, which doesn't cause the runtime to fail, but instead returns a Maybe type - one that either contains a successfully coerced value or Nothing - and the language forces you to check this before you can use the value. You have the best of both worlds now - the ability to write whatever dynamic typed code you want, but with the ability to fall back to a strict type system to keep things in check.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by raiph on Sunday February 22, 2015 @06:46PM (#9091780)
Perl 6 feels dynamic but aiui its functional pieces are statically typed checked and statically call resolved unless a dynamic constraint is used. (See another of my comments in this thread for more on that.)

Aiui method calls are statically type-checked and run-time resolved with a couple exceptions. If a method name (not a method object) is in a variable, type-checking is run-time. If a class is finalized (not yet implemented), method calls are resolved at compile-time.

This is pretty sketchy info because I'm still trying to figure it all out but I'll be trying to confirm it tonight or next week and will post back here if I find out mistakes I've made or more useful info.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by cbd1984 on Monday February 23, 2015 @05:39AM (#9093560)
> unsafeCoerce

This is the exact opposite of dynamic typing. Dynamic typing doesn't throw away type information, it uses it to perform safe conversions, not unsafe coercions.

Re:Perl 6 – Getting beyond static vs. dynamic [pdf] by tel on Monday February 23, 2015 @07:36AM (#9093923)
Haskell does safe coercions. That was the point of the op's argument, actually, but he mistakenly introduced it first through it's implemenation which, after confirming safety, uses a function called 'unsafeCoerce'.

The module is called Data.Dynamic and it is a complete dynamic type system embedded inside Haskell at runtime.

It's not very popular. Read into that whatever you like. There are some reasons to use it, perhaps, but most, to my understanding, see it as opaque and difficult to reason with.