Operational subsumption, an ideal model of subtyping

Electronic Notes in Theoretical Computer Science

Volumn 10, Issue , 1998, Pages 28-49

  Dami, Laurent ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; ERROR ANALYSIS; NUMBER THEORY; PROBLEM SOLVING;

ABADI-CARDELLI OBJECT CALCULUS; ERROR GENERATION; NATURAL NUMBERS; SEMANTIC PREORDERS;

SEMANTICS;

EID: 19144368659     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80686-3     Document Type: Conference Paper

References (24)

1. Abramsky Samson, Luke Ong C.-H. Full Abstraction in the Lazy Lambda Calculus. Information and Computation. 105:1993;159-267
2. Abadi Martin, Cardelli Luca. A Theory of Objects. 1996;Springer-Verlag. Monographs in Computer Science
3. Abadi Martin, Pierce Benjamin, Plotkin Gordon. Faithful Ideal Models for Recursive Polymorphic Types. Int. J. of Foundations for Computer Science. 2:(1):1991;1-21
4. Amadio Roberto, Cardelli Luca. Subtyping Recursive Types. ACM Trans. on Prog. Lang and Systems. 15:(4):1993;575-631
5. Barendregt Henk. The Lambda-Calculus, its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, North-Holland. 1984
6. Breazu-Tannen Val, Coquand Thierry, Gunter Carl A., Scedrov Andre. Inheritance as Implicit Coercion. Information and Computation. 93:1991;172-221. Also in [12], PP 197-245
7. Bruce Kim, Longo Giuseppe. A Modest Model of Records, Inheritance, and Bounded Quantification. Information and Computation. 87:1990;196-240. Also in [12], 151-195
8. Cardone Felice, Coppo Mario. Two extensions of Curry's Type Inference System. Odifreddi P. In Logic and Computer Science. 1990;19-75 Academic Press
9. Dami Laurent. A Lambda-Calculus for Dynamic Binding. Theoretical Comp. Sc. 192:(2):Feb 1998;201-231
10. Laurent Dami. Labeled Reductions, Runtime Errors, and Operational Subsumption. Extended abstract in Proc. ICALP'97, LNCS, Springer-Verlag. 1997.
11. Expanded version in Objects at Large, Technical Report, University of Geneva, 1997, available from http://cuiwww.unige.ch/~dami/publis.html.
12. Andrew Gordon and Gareth Rees. Bisimilarity for a First-Order Calculus of Objects with Subtyping. Technical Report 386, Computer Laboratory, University of Cambridge, January 1996, available at http://www.cl.cam.ac.uk/adg.
13. Technical summary in Proceedings 23rd ACM POPL, Jan 1996, pp 386 - 395.
14. Gunter Carl A., Mitchell John C. Theoretical aspects of object-oriented programming: types, semantics, and language design. 1994;MIT Press. Foundations of computing series
15. Hofmann Martin, Pierce Benjamin C. Positive subtyping. Information and Computation. 126:(1):April 1996;11-33. 10.
16. Howe D.J. Equality in lazy computation systems. In Proc. 4th IEEE Symp. on Logic in Comp. Sc. 1989;198-203
17. Jim Trevor, Meyer Albert R. Full Abstraction and the Context Lemma. SIAM J. on Computing. 25:(3):June 1996;663-696
18. Marina Lenisa. Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-Calculi. Proc. TLCA '97, pp 248 - 266. LNCS 1210, Springer-Verlag, 1997.
19. Liquori Luigi. An Extended Theory of Primitive Objects: First Order System. Proc. ECOOP'97. 1997;146-169 Springer-Verlag. LNCS 1210
20. MacQueen David, Plotkin Gordon, Sethi Ravi. An Ideal Model for Recursive Polymorphic Types. Information and Control. 71:1986;95-130
21. Mason Ian A., Smith Scott F., Talcott Carolyn L. From Operational Semantics to Domain Theory. Information and Computation. 128:1996;26-47
22. Erik Poll. System F with Width-subtyping and Record Updating. Proc. Internat. Symp. on Theoret. Aspects of Comp. Software. Sendai, Japan. LNCS, Springer-Verlag, 1997.
23. Smith Scott. The Coverage of Operational Semantics. Gordon A., Pitts A. In Higher Order Operational Techniques in Semantics. 1998;Cambridge University Press
24. Takahashi M. Parallel Reductions in λcalculus. Information and Computation. 118:(1):1995;120-127