FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES-Reference-Cited by-同舟云学术

FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES

Published:1991-03 Issue:01 Volume:02 Page:1-21
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

ABADI MARTÍN¹,PIERCE BENJAMIN²,PLOTKIN GORDON³

Affiliation:

1. Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, USA

2. School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA

3. Department of Computer Science, King’s Building, University of Edinburgh, Edinburgh, EH9 3JZ, UK

Abstract

We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yields a close fit between models and programming language. Two of our semantics of type expressions are faithful, in the sense that programs that behave identically in all contexts have exactly the same types.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054191000029

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Syntactic soundness proof of a type-and-capability system with hidden state;Journal of Functional Programming;2012-10-10

2. Semantic Subtyping: Challenges, Perspectives, and Open Problems;Lecture Notes in Computer Science;2005

3. Semantic types;ACM SIGPLAN Notices;2004-01

4. Operational Subsumption, an Ideal Model of Subtyping;Electronic Notes in Theoretical Computer Science;1998

5. Labelled reductions, runtime errors, and operational subsumption;Automata, Languages and Programming;1997