A. Mycroft. Dynamic types in statically typed languages. Aug. 1984. Unpublished manuscript, 2nd draft version. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Global Tagging Optimization by Type Inference - Henglein (1992) (46 citations) (Correct)
.... n] 1) NUMBER (lookup x env 0) 8) PROC1 (lookup id env 0) NUMBER 13] map (lambda ( e: List(Symbol, Dynamic) lookup x e) cons env 0 (cons env 1 ( Figure 3: Result of global tagging optimization namic type systems that permit tagging with complete types [Myc84,ACPP91,LW91]. Tag handling operations are implicit in latently typed languages. We make them explicit in order to be able to eliminate (some of) them at compile time and to be sure that they are really eliminated when they do not occur in the final program. In Section 4 we discuss how type and coercion ....
A. Mycroft. Dynamic types in statically typed languages. Aug. 1984. Unpublished manuscript, 2nd draft version.
Combining Recursive and Dynamic Types - Leiss (Correct)
....computaion or raise an exception, otherwise. Clearly, the use of such dynamic type checking should not compromise the soundness of the typing system. In the last few years, several attempts have been made to make restricted use of dynamic typing in statically typed programming languages. A. Mycroft[13], building on ideas of M. Gordon to model dynamic typing by pairs hv; i of values v with their types , introduced a type Dynamic, henceforth called dyn, as an infinite disjoint sum of types, each summand containing values tagged with their type. Inspection of these dynamic values is ....
A. Mycroft. Dynamic types in statically typed languages (2nd draft version). Unpublished typescript, August 1984. This article was processed using the L a T E X macro package with LLNCS style
Combining Recursive and Dynamic Types - Leiss (Correct)
....that their tags range over an infinite set. They can be modelled as infinite sums, with the restriction that the infinite set of tags has some algebraic structure that allows programs to use branching according to finitely many tag patterns, instead of an infinite distinction on tags. A. Mycroft[12] first considered dynamic types as infinite sums of this kind. Instead of working with different dynamic types, it is sufficient to consider one type dyn containing all these hvalue,tagi pairs, with the type as the algebra of tags. 2.1 Simply typed calculus with dyn and recursive types In this ....
....] j[ oe] j=ff] 8fi: oe=ff] j and [ 9fi: j[ oe] j=ff] 9fi: oe=ff] j: 3.2 Implicit polymorphism We now present an interpretation of dynamic and recursive types in a language with implicit polymorphism in the style of ML. This gives a denotational interpretation of A. Mycroft s[12] proposal to extend the functional language ML. He pointed out that functions one would like to have for ML, like print : dyn string or eval : expression Theta environment dyn; could be defined when ML had a type dyn. The previous notion of types is modified by adding universal type ....
A. Mycroft. Dynamic types in statically typed languages (preliminary draft). Unpublished typescript, December 1983.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC