Adding Types to Untyped Languages

被引:0
|
作者
Felleisen, Matthias [1 ]
机构
[1] Northeastern Univ, PLT, Boston, MA 02115 USA
关键词
Software Contracts; Scheme; Type Systems;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Over the last 15 years, we have experienced a programming language renaissance. Numerous scripting languages have become widely used in industrial and open-source projects. They have supplemented the existing mainstream languages-C++ and Java and, in contexts such as systems administration and web programming, they have started to play a dominant role. While each scripting language comes with its own philosophy, their designers share an antipathy to types. As a result, these languages come without a static type system. Most script developers initially welcome this freedom, but soon discover that the lack of a type system deprives them of an essential maintenance tool. My keynote explains my team's approach to equip such languages with a type system. The goal of our work is to empower programmers so that they can gradually enrich scripts with types on a module-by-module basis as they perform maintenance work on the system. Naturally, we wish to ensure type soundness so that the type annotations are meaningful, and we wish to accommodate the programming idioms of the original language in order to keep the overhead of type enrichment low.
引用
收藏
页码:1 / 1
页数:1
相关论文
共 50 条
  • [1] Logical Types for Untyped Languages
    Tobin-Hochstadt, Sam
    Felleisen, Matthias
    ACM SIGPLAN NOTICES, 2010, 45 (09) : 117 - 128
  • [2] Logical Types for Untyped Languages
    Tobin-Hochstadt, Sam
    Felleisen, Matthias
    ICFP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2010, : 117 - 128
  • [3] On polymorphic types of untyped terms
    Statman, Rick
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (06) : 1163 - 1173
  • [4] On Polymorphic Types of Untyped Terms
    Statman, Rick
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, WOLLIC 2011, 2011, 6642 : 239 - 256
  • [5] ADDING ALGEBRAIC REWRITING TO THE UNTYPED LAMBDA CALCULUS
    DOUGHERTY, DJ
    INFORMATION AND COMPUTATION, 1992, 101 (02) : 251 - 267
  • [6] Untyped Recursion Schemes and Infinite Intersection Types
    Tsukada, Takeshi
    Kobayashi, Naoki
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2010, 6014 : 343 - 357
  • [7] LLM-enhanced evolutionary test generation for untyped languages
    Yang, Ruofan
    Xu, Xianghua
    Wang, Ran
    AUTOMATED SOFTWARE ENGINEERING, 2025, 32 (01)
  • [8] Languages and types
    Cho, IH
    Ernst, E
    Holzmüller, B
    Ibrahim, R
    Lorenz, DH
    Pavillet, G
    Smaragdakis, Y
    Virtanen, P
    OBJECT-ORIENTED TECHNOLOGY: ECOOP'98 WORKSHOP READER, 1998, 1543 : 28 - 36
  • [9] Untyped Aspect Calculus : Formal Theory of Aspect-Oriented Programming Languages
    Gopalani, Dinesh
    Govil, M. C.
    2010 IEEE 2ND INTERNATIONAL ADVANCE COMPUTING CONFERENCE, 2010, : 195 - 200
  • [10] Adding multidimensionality to procedural programming languages
    Rondogiannis, P
    INTENSIONAL PROGRAMMING II: BASED ON THE PAPERS AT ISLIP'99, 2000, : 274 - 291