Citations: On understanding types - Luca, Peter (ResearchIndex)

128 citations found. Retrieving documents...

Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471--522, December 1985.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents Next 50

Timber: A Programming Language for Real-Time Embedded.. - Black, Carlsson.. (2002) (Correct)

....subtyping for this nonvariant type constructor can be allowed without any further preconditions. The motivation behind these rules is of course the classical rule for subtyping of function types, which states that S Tis a subtype of S T only if S is a subtype of S, and T is a subtype of T [7]. Timber naturally supports this rule, as well as covariant subtyping for the built in aggregate types: lists, tuples, and arrays. Depth subtyping may be transitively combined with declared subtypes to deduce subtype relationships that are intuitively correct, but perhaps not immediately obvious. ....

Luca Cardelli and Peter Wegner, On Understanding Types, Data Abstraction, and Polymorphism. ACM Computing Surveys, 1985. 17(4): pp 471-522.

Efficient Type Matching - Jha, Palsberg, Zhao (2002) (3 citations) (Correct)

....to the well understood problem of finding a size stable partition of a graph [16] The organization of the paper: A small example is described in Section 2. This example will be used throughout the paper for illustrative purposes. In Section 3 we recall the notions of terms and term automata [1, 8, 11, 13], and we state the definitions of types and type equivalence from the paper by Palsberg and Zhao [17] In Section 4 we prove our main result. An implementation of our algorithm is discussed Section 5. Subtyping of recursive types is discussed in Section 6. Concluding remarks appear in Section 7. ....

Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17(4):471--522, December 1985.

Using Parameterized Signatures to Express Modular Structure - Jones (1996) (32 citations) (Correct)

.... type Complex c = rakCart, rakPolar : Float Float c; re, im : c Float; mag, phase : c Float; There are three established methods for packaging a collection of operations like this together with a suitable implementation type: Existential types (opaque, or weak sums) [23, 5]. In a module of type Bc. Complex c, the existential quantifier conceals the identity of the implementation type c by making it abstract. This approach allows packages to be treated as first class values and is fully compatible with separate compilation. However, for the purposes of modular ....

Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Uomputmg Surveys, 17(4), December 1985.

Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (4 citations) Self-citation (Cardelli) (Correct)

No context found.

Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471-- 522, December 1985.

Coinductive Models of Finite Computing Agents - Wegner, Goldin (1999) (7 citations) Self-citation (Wegner) (Correct)

No context found.

Luca Cardelli and Peter Wegner. On Understanding Types, Data Abstraction, and Polymorphism. Computing Surveys, December 1985.

It is Time to Mechanize Programming Language Metatheory - Pierce, Sewell, Weirich.. (Correct)