L.Cardelli: Extensible records in a pure calculus of subtyping, to appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An extension of system F with subtyping - Cardelli, Martini, Mitchell.. (1991) (22 citations) Self-citation (Cardelli Subtyping) (Correct)
....a range of constructs may be encoded in it (or in F ) these include many of the record operations and subtyping features of [Car 88] CM 91] and related work that are connected to operations used in object oriented programming. We illustrate some of the power of F : in Section 3; see also [Car 91] We have also found that the study of F : raises semantic questions of independent interest. A major concern in this paper is an equational theory for F : terms. The equational axioms for most systems of typed l calculi arise naturally as a consequence of characterizing type connectives by ....
....i0. n 1 E # a 0 : A 0 . E # a n : A n n0, i0. n E # tuple(a 0 , a n ,top) i a i : A i 3.5. Simple records We restrict ourselves to the encoding of simple records (the ones with a fixed number of components [CL 90] extensible records are treated in [Car 91] Let L be a countable set of labels, enumerated by a bijection iLNat. We indicate by l i , with a superscript, the i th label in this enumeration. Often we need to refer to a list of n distinct labels out of this enumeration; we then use subscripts, as in l 1 . l n . So we may have, for ....
L.Cardelli: Extensible records in a pure calculus of subtyping, to appear.
An extension of system F with subtyping - Cardelli, Martini, Mitchell.. (1991) (22 citations) Self-citation (Cardelli) (Correct)
....range of constructs may be encoded in it (or in F ) these include many of the record operations and subtyping features of [Car 88] CM 91] and related work that are connected to operations used in object oriented programming. We illustrate some of the power of F : in Section 3; see also [Car 91] We have also found that the study of F : raises semantic questions of independent interest. A major concern in this paper is an equational theory for F : terms. The equational axioms for most systems of typed l calculi arise naturally as a consequence of characterizing type connectives ....
....0 : A 0 . E # a n : A n n0, i0. n E # tuple(a 0 , a n ,top) i a i : A i 3.5. Simple records We restrict ourselves to the encoding of simple records (the ones with a fixed number of components [CL 90] extensible records are treated in [Car 91] Let L be a countable set of labels, enumerated by a bijection iLNat. We indicate by l i , with a superscript, the i th label in this enumeration. Often we need to refer to a list of n distinct labels out of this enumeration; we then use subscripts, as in l 1 . l n . So we may have, for ....
L.Cardelli: Extensible records in a pure calculus of subtyping, to appear.
An Implementation Model of Rendezvous Communication - Cardelli (1985) (5 citations) Self-citation (Cardelli) (Correct)
....Cardelli AT T Bell Laboratories Murray Hill, New Jersey 07974 Introduction This paper describes the low level primitives necessary to implement a particular flavor or inter process communication. It is motivated by the design of a communication subsystem for a higher order functional language [Cardelli 84] Although we try to abstract somewhat from the special characteristics of that language, the model does not accommodate a wide range of communication schemes. This communication model is intended to be used on (uniprocessor) personal computers. In this model, processes running on the same ....
L.Cardelli: Amber. To appear.
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