Browse thread
Type annotations
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2000-12-14 (18:31) |
From: | Ohad Rodeh <orodeh@c...> |
Subject: | Type annotations |
Dear List, I've previously sent a message, for which I got no replies, so I'm resending it. > ... stuff removed ... > > > Also, I am a bit curious why it doesn't help to type explicitely, > > i.e. to > > write > > let x:point_3d={x=10.;y=20.;z=30.} ??? > > > > Because this is not the way it works. Labels are defined as are values > or constructors, this is only afterwards that the compiler checks that > they all belong to the same type. That is, the type cannot influence the > choice between x(point_3d) and x(point_2d), only the order of > definition can. > > There has been already various proposals for allowing types to be taken > into account when typing record labels. The difficulty is that as soon > as you make it into something useful, you loose the principal type > property, and that some theoreticians working on ocaml wouldn't like > it. The loss of the pricipal type theorem has also recently been discussed in comp.lang.ml and comp.lang.functional. Using type-annotation by the compiler prior (call this the PRIOR approach) to unification can help typing expression that cannot be typed otherwise. For example, cases of polymoriphic recursion. In fact, this is the way this is handled in Haskell (this topic has also appeared in this list previously). Although I wouldn't go running to implement all my code in Haskell :-), I do think that using PRIOR could be an improvement. Is there a problem with PRIOR? Ohad.