Labelled reductions, runtime errors, and operational subsuniption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 782-793

  Dami, Laurent ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84951000664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_231     Document Type: Conference Paper

References (21)

1. Samson Abramsky and C.-H. Luke Ong. Full Abstraction in the Lazy Lambda Calculus. Information and Computation, 105:159-267, 1993.
2. Martin Abadi, Benjamin Pierce and Gordon Plotkin. Faithful Ideal Models for Recursive Polymorphic Types. Int. J. of Foundations for Computer Science, 2(1):1-21, 1991.
3. Henk Barendregt. The Lambda-Calculus, its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, North-Holland, 1984.
4. Baard Bloom. Can LCF Be Topped? Flat Lattice Models of Typed A-calculus. Information and Computation 87:264-301, 1990.
5. Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as Implicit Coercion. Information and Computation 93:172-221, 1991. Also in [11], pp 197-245
6. A Modest Model of Records, Inheritance, and Bounded Quantification. Information and Computation 87:196-240, 1990. Also in [11], pp 151-195
7. Felice Cardone and Mario Coppo. Two extensions of Curry's Type Inference System. In Logic and Computer Science, P. Odifreddi(ed), pp 19-75. Academic Press, 1990.
8. Luca Cardelli and John Mitchell. Operations on Records. In [11], pp 295-350. First appeared in Math. Structures in Comp. Sc., 1991, pp 3-48.
9. Laurent Dami. A Lambda-Calculus for Dynamic Binding. To appear in Theoretical Comp. Sc., special issue on Coordination, 1997.
10. Laurent Dami. Labelled Reductions, Runtime Errors, and Operational Sub-sumption. Technical Report, U. of Geneva, 1997. Currently available at http://cuiwww.unige.ch/~dami.
11. Carl A. Gunter and John C. Mitchell, eds. Theoretical aspects of object-oriented programming: types, semantics, and language design. MIT Press, Foundations of computing series, 1994.
12. D. J. Howe. Equality in lazy computation systems. In Proc. 4th IEEE Symp. on Logic in Comp. Sc., pp 198-203, 1989.
13. Trevor Jim and Albert R. Meyer. Full Abstraction and the Context Lemma. SI AM J. on Computing 25(3):663-696, June 1996.
14. Jan W. Klop, Vincent van Oostrom and Femke van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279-308, 1993.
15. David MacQueen, Gordon Plotkin and Ravi Sethi. An Ideal Model for Recursive Polymorphic Types. Information and Control, 71:95-130, 1986.
16. Ian A. Mason, Scott F. Smith and Carolyn L. Talcott. From Operational Semantics to Domain Theory. In Information and Computation, 128:26-47, 1996.
17. Gordon Plotkin. Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science, 1:125-159, 1975.
18. Didier Remy. Typechecking records and variants in a natural extension of ML. In Proceedings ACM POPL'89, pp 242-249. Also in [11], pp 67-96.
19. Dana Scott. Data types as lattices. SIAM J. of Computing, 5:522-587, 1976.
20. C. Talcott, A Theory of Binding Structures and Applications to Rewriting, Theoretical Computer Science, 112:99-143, 1993.
21. Mitchell Wand. Type Inference for Record Concatenation and Multiple Inheritance. Information and Computation, 93(l):l-15, 1991