Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421590 | Electronic Notes in Theoretical Computer Science | 2011 | 13 Pages |
Abstract
Dynamically typed languages are flexible and impose few burdens on the programmer. In contrast, static typing leads to software that is more efficient and has fewer errors. However, static type systems traditionally require every variable to have one type, and that relationships between types (e.g. subclassing) be declared explicitly.The Whiley language aims to hit a sweet spot between dynamic and static typing. This is achieved through structural subtyping and by typing variables in a flow-sensitive fashion. Whiley compiles to the JVM, and this presents a number of challenges. In this paper, we discuss the implementation of Whileyʼs type system on the JVM.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics