Sets, types and type-checking

被引:1
|
作者
Turner, R [1 ]
机构
[1] Univ Essex, Dept Comp Sci, Colchester CO4 3SQ, Essex, England
关键词
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 条
  • [31] Parallel Type-checking with Haskell using Saturating LVars and Stream Generators
    Newton, Ryan R.
    Agacan, Omer S.
    Fogg, Peter
    Tobin-Hochstadt, Sam
    ACM SIGPLAN NOTICES, 2016, 51 (08) : 61 - 72
  • [32] Static type-checking for programs developed on the platform 1C:Enterprise
    Irkutsk State University, 1, K. Marx st., Irkutsk
    664003, Russia
    CEUR Workshop Proc., (101-111):
  • [33] A DENOTATIONAL APPROACH FOR TYPE-CHECKING IN OBJECT-ORIENTED PROGRAMMING-LANGUAGES
    IERUSALIMSCHY, R
    COMPUTER LANGUAGES, 1993, 19 (01): : 19 - 40
  • [34] A Type-Checking Algorithm for Martin-Lof Type Theory with Subtyping Based on Normalisation by Evaluation
    Fridlender, Daniel
    Pagano, Miguel
    TYPED LAMBDA CALCULI AND APPLICATIONS, TLCA 2013, 2013, 7941 : 140 - 155
  • [35] Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
    Colazzo, D.
    Ghelli, G.
    Pardini, L.
    Sartiani, C.
    THEORETICAL COMPUTER SCIENCE, 2013, 492 : 88 - 116
  • [36] Checked Load: Architectural Support for Java']JavaScript Type-Checking on Mobile Processors
    Anderson, Owen
    Fortuna, Emily
    Ceze, Luis
    Eggers, Susan
    2011 IEEE 17TH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE (HPCA), 2011, : 419 - 430
  • [37] Incremental type-checking for free: using scope graphs to derive incremental type-checkers
    Zwaan A.
    Van Antwerpen H.
    Visser E.
    Proceedings of the ACM on Programming Languages, 2022, 6 (OOPSLA2): : 424 - 448
  • [38] Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
    Nakazawa, Koji
    Tatsuta, Makoto
    Kameyama, Yukiyoshi
    Nakano, Hiroshi
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2008, 5213 : 478 - +
  • [39] Refactoring Delta-Oriented Product Lines to Enforce Guidelines for Efficient Type-Checking
    Damiani, Ferruccio
    Lienhardt, Michael
    LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION: DISCUSSION, DISSEMINATION, APPLICATIONS, ISOLA 2016, PT II, 2016, 9953 : 579 - 596
  • [40] Well-definedness and semantic type-checking in the nested relational calculus and XQuery extended abstract
    Van den Bussche, J
    Van Gucht, D
    Vansummeren, S
    DATABASE THEORY - ICDT 2005, PROCEEDINGS, 2005, 3363 : 99 - 113