Syntactic Logical Relations for Polymorphic and Recursive Types

被引:17
|
作者
Crary, Karl [1 ]
Harper, Robert [1 ]
机构
[1] Carnegie Mellon Univ, Comp Sci Dept, Pittsburgh, PA 15213 USA
关键词
Operational semantics; type structure; logics of programs; lambda calculus and related systems; data abstraction; polymorphism;
D O I
10.1016/j.entcs.2007.02.010
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in the study of typed languages, for example to establish contextual equivalences of terms. The chief difficulty in using logical relations is to establish the existence of a suitable relational interpretation. We extend work of Pitts and Birkedal and Harper on constructing relational interpretations of types to polymorphism and recursive types, and apply it to establish parametricity and representation independence properties in a purely operational setting. We argue that, once the existence of a relational interpretation has been established, it is straightforward to use it to establish properties of interest.
引用
收藏
页码:259 / 299
页数:41
相关论文
共 50 条
  • [1] Step-indexed syntactic logical relations for recursive and quantified types
    Ahmed, A
    [J]. PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2006, 3924 : 69 - 83
  • [2] Syntactic considerations on recursive types
    Abadi, M
    Fiore, MP
    [J]. 11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1996, : 242 - 252
  • [3] AN IDEAL MODEL FOR RECURSIVE POLYMORPHIC TYPES
    MACQUEEN, D
    PLOTKIN, G
    SETHI, R
    [J]. INFORMATION AND CONTROL, 1986, 71 (1-2): : 95 - 130
  • [4] Logical relations for monadic types
    Goubault-Larrecq, Jean
    Lasota, Slawomir
    Nowak, David
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2008, 18 (06) : 1169 - 1217
  • [5] Logical relations for monadic types
    Goubault-Larrecq, J
    Lasota, S
    Nowak, D
    [J]. COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2002, 2471 : 553 - 568
  • [6] Logical equivalence for subtyping object and recursive types
    van Bakel, Steffen
    de'Liguoro, Ugo
    [J]. THEORY OF COMPUTING SYSTEMS, 2008, 42 (03) : 306 - 348
  • [7] Logical Equivalence for Subtyping Object and Recursive Types
    Steffen van Bakel
    Ugo de’Liguoro
    [J]. Theory of Computing Systems, 2008, 42 : 306 - 348
  • [8] Recursive polymorphic types and parametricity in an operational framework
    Melliès, PA
    Vouillon, J
    [J]. LICS 2005: 20TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE - PROCEEDINGS, 2005, : 82 - 91
  • [9] FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
    ABADI, M
    PIERCE, B
    PLOTKIN, G
    [J]. FOURTH ANNUAL SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 1989, : 216 - 225
  • [10] On completeness of logical relations for monadic types
    Lasota, Slawomir
    Nowak, David
    Zhang, Yu
    [J]. ADVANCES IN COMPUTER SCIENCE - ASIAN 2006: SECURE SOFTWARE AND RELATED ISSUES, 2007, 4435 : 223 - 230