2 citations found. Retrieving documents...
L.Cardelli: Amber, Combinators and Functional Programming Languages, Proc. of the 13th Summer School of the LITP, Le Val D'Ajol, Vosges (France), May 1985. Lecture Notes in Computer Science n. 242, Springer-Verlag, 1986.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Typeful Programming - Luca Cardelli Digital (1989)   (77 citations)  Self-citation (Cardelli)   (Correct)

No context found.

L.Cardelli: Amber, Combinators and Functional Programming Languages, Proc. of the 13th Summer School of the LITP, Le Val D'Ajol, Vosges (France), May 1985. Lecture Notes in Computer Science n. 242, Springer-Verlag, 1986.


Typeful Programming - Cardelli (1989)   (77 citations)  Self-citation (Cardelli)   (Correct)

.... is ML; the mechanisms we adopt later are more closely related to Russell [Demers Donahue 79] and Pebble [Burstall Lampson 84] The notion of subtype polymorphism we consider first appeared in Simula67 [Dahl Nygaard 66] single inheritance) and is more closely related to the one in Amber [Cardelli 86] multiple inheritance) A major aim here is to unify parametric and subtype polymorphism in a single type system. Subtyping is a relation between types, similar to the relation of containment between sets. If A is a subtype of B, then any object of type A is also an object of type B. In other ....

....name was found in a record last time , and do a full lookup only when this fails. With this scheme, the majority of accesses are still done in constant time (maybe 5 machine instructions) and there is gentle degradation when type hierarchies become more complex and cache hits tend to decrease [Cardelli 86] A variant type is an unordered named collection of types, where the names are distinct. A variant is a tagged value, with the value matching the proper branch of the relevant variant type. Variant xi:A 1 . Xn:A n end variant x of A with a end Otherwise, variants and variant types are ....

L.Cardelli: Amber, Combinators and Functional Programming Languages, Proc. of the 13th Summer School of the LITP, Le Val D'Ajol, Vosges (France), May 1985. Lecture Notes in Computer Science n. 242, Springer-Verlag, 1986.

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