An extension of standard ML modules with subtyping and inheritance

Mitchell, John C.; Meldal, Sigurd; Madhav, Neel

doi:10.1145/99583.99620

Cited by 36 publications

(12 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…nesT modules are more expressive in their support of first class modules as values and the possibility of dynamic construction of "type exports." That said, first class modules are not new [1,25], we only claim novelty in their application to program staging and the incorporation of dynamic type construction.…”

Section: Related Workmentioning

confidence: 94%

Scalaness/nesT

et al. 2013

View full text Add to dashboard Cite

Programming wireless embedded networks is challenging due to severe limitations on processing speed, memory, and bandwidth. Staged programming can help bridge the gap between high level code refinement techniques and efficient device level programs by allowing a first stage program to specialize device level code. Here we introduce a two stage programming system for wireless sensor networks. The first stage program is written in our extended dialect of Scala, called Scalaness, where components written in our type safe dialect of nesC, called nesT, are composed and specialized. Scalaness programs can dynamically construct TinyOS-compliant nesT device images that can be deployed to motes. A key result, called cross-stage type safety, shows that successful static type checking of a Scalaness program means no type errors will arise either during programmatic composition and specialization of WSN code, or later on the WSN itself. Scalaness has been implemented through direct modification of the Scala compiler. Implementation of a staged public-key cryptography calculation shows the sensor memory footprint can be significantly reduced by staging.

show abstract

Section: Related Workmentioning

confidence: 94%

Scalaness/nesT

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Indeed our approach mainly comes from the domain of functional languages, where parametricity in module systems has been largely studied [3]. Extensions of modules with subtyping and inheritance were proposed, e.g [11], but in a context of side-effect-free languages. This is on-going work and it clearly remains to formalize the proposed constructions, to express what are the necessary verification conditions in general, and to show a soundness result.…”

Section: Related Work Perspectivesmentioning

confidence: 99%

Specifying generic Java programs

Giorgetti

Marché

Tushkanova

et al. 2010

Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications

View full text Add to dashboard Cite

This work investigates the question of modular specification of generic Java classes and methods. We propose extensions to the Krakatoa Modeling Language, a part of the Why platform for proving that a Java or C program is a correct implementation of some specification. The new constructs we propose for the specification of generic Java programs are presented through two significant examples: the specification of the generic method for sorting arrays which comes from the java.util.Arrays class in the Java API, and the specification of the java.util.HashMap class defining a generic hash map and its use for memoization. The key features are the introduction of parametricity both for types and for theories and an instantiation relation between theories. We discuss soundness conditions and their verification.

show abstract

“…For example, rather than regard generativity of abstract types as an alternative to non-generative types, we make both mechanisms available in the language. We support both generative and applicative functors, admit translucent signatures, support separate compilation, and are able to accommodate modules as first-class values [24,29].…”

Section: A Type System For Modulesmentioning

confidence: 99%

“…However, following Mitchell et al [24] and Russo [29], we provide a way of packaging a module as a first-class value. In prior work, such packaged modules are typically given an existential type, whose closed-scope elimination construct can make for awkward programming.…”

Section: Existential Signaturesmentioning

confidence: 99%

A type system for higher-order modules

2003

View full text Add to dashboard Cite

We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules as first-class values. Our type system harmonizes design elements from previous work, resulting in a simple, economical account of modular programming. The main unifying principle is the treatment of abstraction mechanisms as computational effects. Our language is the first to provide a complete and practical formalization of all of these critical issues in module system design.

show abstract

An extension of standard ML modules with subtyping and inheritance

Abstract: We describe a general module language integrating abstract data types, specifications and object-oriented

Cited by 36 publications

References 19 publications

Scalaness/nesT

Scalaness/nesT

Specifying generic Java programs

A type system for higher-order modules

Contact Info

Product

Resources

About