Sets, types and type-checking

被引：1
|
作者：
Turner, R [1 ]
机构：
[1] Univ Essex, Dept Comp Sci, Colchester CO4 3SQ, Essex, England
来源：
JOURNAL OF LOGIC AND COMPUTATION | 1999年 / 9卷 / 06期
关键词：
Z; specification; set theory; type assignment; type theory;
D O I：
10.1093/logcom/9.6.959
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The underlying set theory of the Z-specification language is said to be a typed set theory. There are two interpretations of this to be found in the literature. One is based upon Simple Type theory and the other on set theory plus a type assignment system. We establish their equivalance.
引用
收藏
页码：959 / 975
页数：17
相关论文
共 50 条
  • [21] Incremental Type-Checking for Type-Reflective Metaprograms
    Miao, Weiyu
    Siek, Jeremy
    ACM SIGPLAN NOTICES, 2011, 46 (02) : 167 - 176
  • [22] Type-checking multi-parameter type classes
    Duggan, D
    Ophel, J
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2002, 12 : 133 - 158
  • [23] JDeodorant: Identification and removal of type-checking bad smells
    Tsantalis, Nikolaos
    Chaikalis, Theodoros
    Chatzigeorgiou, Alexander
    CSMR 2008: 12TH EUROPEAN CONFERENCE ON SOFTWARE MAINTENANCE AND REENGINEERING: DEVELOPING EVOLVABLE SYSTEMS, 2008, : 329 - 331
  • [24] Lintent: Towards Security Type-Checking of Android Applications
    Bugliesi, Michele
    Calzavara, Stefano
    Spano, Alvise
    FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS, FMOODS/FORTE 2013, 2013, 7892 : 289 - 304
  • [25] TYPE-CHECKING LIVENESS FOR COLLABORATIVE PROCESSES WITH BOUNDED AND UNBOUNDED RECURSION
    Debois, Soren
    Hildebrandt, Thomas
    Slaats, Tijs
    Yoshida, Nobuko
    LOGICAL METHODS IN COMPUTER SCIENCE, 2016, 12 (01)
  • [26] Efficient Type-Checking for Amortised Heap-Space Analysis
    Hofmann, Martin
    Rodriguez, Dulma
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2009, 5771 : 317 - 331
  • [27] Decidability of type-checking in the calculus of algebraic constructions with size annotations
    Blanqui, F
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 135 - 150
  • [28] Experience Report: Type-checking Polymorphic Units for Astrophysics Research in Haskell
    1600, Association for Computing Machinery (49):
  • [29] Well-definedness and semantic type-checking for the nested relational calculus
    Van den Bussche, Jan
    Van Gucht, Dirk
    Vansummeren, Stijn
    THEORETICAL COMPUTER SCIENCE, 2007, 371 (03) : 183 - 199
  • [30] Experience Report: Type-checking Polymorphic Units for Astrophysics Research in Haskell
    Muranushi, Takayuki
    Eiscnberg, Richard A.
    ACM SIGPLAN NOTICES, 2014, 49 (12) : 31 - 38
12345