Didier Remy. Records and variants as a natural extension of ML. In ACM Symposium on Principles Of Programming Languages (POPL), 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....allowing some inheritance between them: records with more labels should be allowed where records with fewer labels are required. After defining the operations on records and recalling related work, we first review the solution for a finite (and small) set of labels, which was presented in [R em89] then we extend it to a denumerable set of labels. In the last part we discuss the power and weakness of the solution, we describe some variations, and suggest improvements. Without records, data structures are built using product types, as in ML, for instance. Peter , John , Professor , ....

....ML with records having inheritance. The year after, complete type inference algorithms were found for a strong restriction of this system [JM88, OB88] The restriction only allows the strict extension of a record. Then, the author proposed a complete type inference algorithm for Wand s system [R em89] but it was formalized only in the case of a finite set of labels (a previous solution given by Wand in 1988 did not admit principal types but complete sets of principal types, and was exponential in size in practice) Mitchell Wand revisited this approach and extended it with an and ....

[Article contains additional citation context not shown here]

Didier R'emy. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989.

....are also annotated by sets of exceptions and integers respectively. Those sets re ne the ML types exn and int by restricting the values that an expression of type exn[ or int[ can have. Sets of exceptions or integers are represented by rows similar to those used for typing extensible records [30, 20, 22]. A row is either , meaning that all values of the type are possible (we do not have any more precise information) or a sequence of row elements 1 : n terminated by a row variable ae. We impose the following equational theory on rows to express that the order of elements in a row does ....

....mutable data structures. On those two cases, 3] obtains more precise results than our analysis. 6. 2 Other related work Our use of rows with row variables and presence annotations to approximate values of base types and sum types is essentially identical to R#my s typing of extensible variants [20]. Another application of R#my s encoding is the soft typing system for Scheme of [32] There is a natural connection between exception analysis and type inference for extensible variants: using the well known functional encoding of exceptions (where each subexpression is transformed to return a ....

Didier R#my. Records and variants as a natural extension of ML. In 16th symposium Principles of Programming Languages, pages 7788. ACM Press, 1989.

....coming from other computational paradigms such as logic programming, object oriented programming, or communicating processes with the strong static typing, type inference, and higher orderness of ML. Some of these propositions are extensions of the type system: records with structural subtyping [15, 31, 53], the type classes of Haskell [60] the dynamic objects [1] Others introduce new mechanisms in the execution model: call by unification (narrowing) communicating processes. Finally, new efficient implementation techniques have been proposed, such as high level program transformations and ....

.... introduction, and very convincing examples can be found in Cardelli and Wegner [15] Such records with inclusion can be integrated to the ML language quite nicely, and still allow type inference, as in the systems proposed by Jategaonkar and Mitchell [31] by Ohori and Buneman [48] and by R emy [53, 54]. Records with inclusions are not implemented in ZINC yet, but it should not be too difficult, using the typechecker presented in R emy s thesis [54] and the efficient representation for records presented below (section 4.3.4) 4.1.5 Extensible sums The last extension we shall consider here is ....

Didier R'emy. "Records and variants as a natural extension of ML." 16th Ann. ACM Symp. on Principles of Programming Languages, 1989.

.... that have been introduced in [R em90, R em92c] in order to get a type system for the record extension of ML presented in [R em90, R em91] Record types are based on the idea that types of records should carry information on all fields saying for every label either the field is present or absent [R em89]. The way to deal with an infinite collection of labels is to give explicit information for a finite number of fields and gather all information about other fields in a template, called a row. Record types allow sharing between the same fields of two rows, but do not allow sharing between all ....

Didier R'emy. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989.

....also annotated by sets of exceptions and integers respectively. Those sets refine the ML types exn and int by restricting the values that an expression of type exn[ or int[ can have. Sets of exceptions or integers are represented by rows similar to those used for typing extensible records [31, 21, 23]. A row is either , meaning that all values of the type are possible (we do not have any more precise information) or a sequence of row elements 1 : n terminated by a row variable ae. We impose the following equational theory on rows to express that the order of elements in a row does ....

....mutable data structures. On those two cases, 3] obtains more precise results than our analysis. 6. 2 Other related work Our use of rows with row variables and presence annotations to approximate values of base types and sum types is essentially identical to R emy s typing of extensible variants [21]. Another application of R emy s encoding is the soft typing system for Scheme of [33] There is a natural connection between exception analysis and type inference for extensible variants: using the well known functional encoding of exceptions (where each subexpression is transformed to return a ....

D. R'emy. Records and variants as a natural extension of ML. In 16th symp. Principles of Progr. Lang., pages 77--88. ACM Press, 1989.

....parametric polymorphism and the concept of a row variable to provide the desired flexibility and also offered the prospect of type inference. Subsequently there have been several proposals for similar systems including the Machiavelli language of Atsushi Ohori [OBBT89] the system of Didier R emy [R em89] and the ML language of Jategaonkar and Mitchell [JM88] RAVL, the language introduced in this paper, is similar to languages studied in [R em89, R em90, R em93] The new language is the Records And Variants Language RAVL. Some of the basic design goals of RAVL can be summarized as follows: ....

Didier R'emy. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989.

No context found.

Didier Remy. Records and variants as a natural extension of ML. In ACM Symposium on Principles Of Programming Languages (POPL), 1989.

No context found.

Didier R emy. Records and variants as a natural extension of ML. In ACM Symposium on Principles Of Programming Languages (POPL), 1989.

No context found.

Didier R'emy. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989. subsumed by [*R'em91].

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