A Nominal Theory of Objects with Dependent Types

Odersky, Martin; Cremet, Vincent; Röckl, Christine; Zenger, Matthias

doi:10.1007/978-3-540-45070-2_10

Cited by 115 publications

(93 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Featherweight Scala describes the central constructs for programming components in Scala: nested classes, modular mixin composition, abstract types, type aliases, and path-dependent types. Unlike previous work on foundations of Scala [25], this calculus is decidable and admits a straight-forward type-checking algorithm.…”

Section: Resultsmentioning

confidence: 99%

“…We intend to show in future work that it satisfies the subject-reduction and type-soundness properties. Judging from our experience with previous calculi [25,10] this looks plausible, but a formal proof still needs to be completed.…”

Section: Resultsmentioning

confidence: 99%

“…All three have been studied in the νObj calculus [25]. A key concept of the νObj calculus, path-dependent types, is also present in Scala.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Core Calculus for Scala Type Checking

Cremet

Garillot

Lenglet

et al. 2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Core Calculus for Scala Type Checking

Cremet

Garillot

Lenglet

et al. 2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Previous formalizations include the νObj calculus (Odersky et al, 2003), Featherweight Scala (Cremet et al, 2006) and Scalina (Moors et al, 2008). The νObj calculus features a rich type language, including distinct notions of singleton types, type selections, record types, class types and compound types.…”

Section: Related Workmentioning

confidence: 99%

“…Work on DOT started in 2007, following earlier work on higher-level formalizations of Scala features (Odersky et al, 2003;Cremet et al, 2006). Preliminary versions of a calculus with path-dependent types were published in FOOL 2012 (Amin et al, 2012) and OOPSLA 2014 (Amin et al, 2014).…”

Section: Introductionmentioning

confidence: 99%

The Essence of Dependent Object Types

Amin

Grütter

Odersky

et al. 2016

A List of Successes That Can Change the World

Self Cite

View full text Add to dashboard Cite

Abstract. Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D<: of dependent functions, it adds records, intersections and recursion to arrive at DOT, a calculus for dependent object types. The paper shows an encoding of System F with subtyping in D<: and demonstrates the expressiveness of DOT by modeling a range of Scala constructs in it.

show abstract

KERIS: evolving software with extensible modules

Zenger

2005

J. Softw. Maint. Evol.: Res. Pract.

Self Cite

View full text Add to dashboard Cite

We present the programming language KERIS, an extension of Java with explicit support for software evolution. KERIS introduces extensible modules as the basic building blocks for software. Modules are composed hierarchically, explicitly revealing the architecture of systems. A distinct feature of the module design is that modules do not get linked manually. Instead, the wiring of modules gets inferred. The module assembly and refinement mechanism of KERIS is not restricted to the unanticipated extensibility of atomic modules. It also allows extensions of already linked systems by replacing selected submodules with compatible versions without needing to re-link the full system. Extensibility is type-safe and noninvasive, i.e., the extension of a module preserves the original version and does not require access to source code.Modules, as architectural building blocks, are subject to continuous change. We consider this lack of support for unanticipated extensibility to be a serious shortcoming. In practice, one is required to use ad-hoc techniques to introduce changes in modules. In most cases this comes down to hacking the changes into the source code of the corresponding modules. This obviously contradicts the idea of deploying compiled module binaries. However, even for cases where the source code is available, invasive changes such as source code modifications are considered error-prone. With modifications on the source code level one risks invalidating the use of modules in contexts where they get already successfully deployed.The design of the programming language KERIS includes primitives for creating and linking modules as well as mechanisms for extending modules or even fully linked programs statically. KERIS' type system ensures that the definition, assembly and evolution of modules is safe. Programs written in KERIS are closed in the sense that they can be executed, but they are open for extensions that statically add, refine or replace modules or whole subsystems of interconnected modules. Extensibility does not have to be planned ahead and does not require modifications of existing source code, promoting a smooth software evolution process.In this paper we introduce KERIS as an extension of the programming language Java. In Section 2 we substantiate the need for linguistic abstractions in object-oriented programming languages for programming in the large and for evolving systems safely in the large. In Section 3 we present the design of the programming language KERIS by a stepwise introduction of KERIS' extensible module abstractions. The examples presented in Section 4 explain how extensible modules support family polymorphism. Section 5 gives an informal overview over the type-system. Our prototypical implementation of the KERIS compiler gets briefly reviewed in Section 6, followed by a discussion of related work in Section 7. Section 8 concludes. MOTIVATIONLike many popular object-oriented languages, Java does not provide suitable abstractions for programming in the large [4]. In this section we argu...

show abstract

A Nominal Theory of Objects with Dependent Types

Cited by 115 publications

References 31 publications

A Core Calculus for Scala Type Checking

A Core Calculus for Scala Type Checking

The Essence of Dependent Object Types

KERIS: evolving software with extensible modules

Contact Info

Product

Resources

About