DATA TYPES AS VALUES: POLYMORPHISM, TYPE-CHECKING, ENCAPSULATION.

被引:0
|
作者
Demers, Alan
Donahue, James
Skinner, Glenn
机构
来源
| 1978年
关键词
DATA TYPES - ENCAPSULATION - POLYMORPHISM - TYPE-CHECKING RULES;
D O I
暂无
中图分类号
学科分类号
摘要
One of the goals of research in programming languages is the isolation of the underlying concepts of languages, i. e. , those basic ideas that allow us to understand the relations among various language features. This paper describes a novel approach to the treatment of data types in programming languages, which allows a simple interpretation of ″polymorphic″ or ″generic″ procedures, makes a simple set of type-checking rules semantically justifiable and provides a straightforward treatment of encapsulation.
引用
收藏
页码:23 / 30
相关论文
共 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] DATA TYPES, PARAMETERS AND TYPE CHECKING.
    Demers, Alan J.
    Donahue, James E.
    Conference Record of the Annual ACM Symposium on Principles of Programming Languages, 1980, : 12 - 23
  • [26] 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)
  • [27] Efficient Type-Checking for Amortised Heap-Space Analysis
    Hofmann, Martin
    Rodriguez, Dulma
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2009, 5771 : 317 - 331
  • [28] Decidability of type-checking in the calculus of algebraic constructions with size annotations
    Blanqui, F
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 135 - 150
  • [30] 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