Subtyping object and recursive types logically (Extended abstract)

被引：0
|
作者：
van Bakel, S
de'Liguoro, U
机构：
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2BZ, England
[2] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy
来源：
THEORETICAL COMPUTER SCIENCE, PROCEEDINGS | 2005年 / 3701卷
关键词：
INHERITANCE; MODEL;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order zeta-calculus is modelled by this notion, which on turn is included in a Morris style contextual equivalence.
引用
收藏
页码：66 / 80
页数：15
相关论文
共 50 条
  • [1] Logical Equivalence for Subtyping Object and Recursive Types
    Steffen van Bakel
    Ugo de’Liguoro
    Theory of Computing Systems, 2008, 42 : 306 - 348
  • [2] Logical equivalence for subtyping object and recursive types
    van Bakel, Steffen
    de'Liguoro, Ugo
    THEORY OF COMPUTING SYSTEMS, 2008, 42 (03) : 306 - 348
  • [3] SUBTYPING RECURSIVE TYPES
    AMADIO, RM
    CARDELLI, L
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1993, 15 (04): : 575 - 631
  • [4] A Calculus with Recursive Types, Record Concatenation and Subtyping
    Zhou, Yaoda
    Oliveira, Bruno C. D. S.
    Fan, Andong
    PROGRAMMING LANGUAGES AND SYSTEMS, APLAS 2022, 2022, 13658 : 175 - 195
  • [5] Pure type systems with subtyping (Extended abstract)
    Zwanenburg, J
    TYPED LAMBDA CALCULI AND APPLICATIONS, 1999, 1581 : 381 - 396
  • [6] Coercive subtyping for the calculus of constructions (extended abstract)
    Chen, G
    ACM SIGPLAN NOTICES, 2003, 38 (01) : 150 - 159
  • [7] ABSTRACT OBJECT TYPES =ABSTRACT KNOWLEDGE TYPES+ABSTRACT DATA TYPES+ABSTRACT CONNECTOR TYPES
    PARK, HS
    JOURNAL OF OBJECT-ORIENTED PROGRAMMING, 1991, 4 (03): : 37 - &
  • [8] Structural subtyping of non-recursive types is decidable
    Kuncak, V
    Rinard, M
    18TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2003, : 96 - 107
  • [9] Subtyping recursive types modulo associative commutative products
    Di Cosmo, R
    Pottier, F
    Rémy, D
    TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS, 2005, 3461 : 179 - 193
  • [10] ABSTRACT OBJECT TYPES FOR DATABASES
    EHRICH, HD
    SERNADAS, A
    SERNADAS, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 334 : 144 - 149
12345