The definition of Extended ML: A gentle introduction

Kahrs, Stefan; Sannella, Donald; Tarlecki, Andrzej

doi:10.1016/s0304-3975(96)00163-6

Cited by 61 publications

(20 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This assumption is valid for Standard ML. It is also true for Extended ML [8], in whose formalization Kahrs et al employ similar higher-order rules with different motivation. However, from a language design standpoint, this condition is unnecessarily limiting.…”

Section: The Sml/nj Approachmentioning

confidence: 99%

Principal Type Schemes for Modular Programs

Dreyer

Blume

2007

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these features have been studied extensively, their interaction has never received a proper type-theoretic treatment. One consequence is that both the official Definition and the alternative Harper-Stone semantics of Standard ML are difficult to implement correctly. To bolster this claim, we offer a series of short example programs on which no existing SML typechecker follows the behavior prescribed by either formal definition. It is unclear how to amend the implementations to match the definitions or vice versa. Instead, we propose a way of defining how type inference interacts with modules that is more liberal than any existing definition or implementation of SML and, moreover, admits a provably sound and complete typechecking algorithm via a straightforward generalization of Algorithm W. In addition to being conceptually simple, our solution exhibits a novel hybrid of the Definition and Harper-Stone semantics of SML, and demonstrates the broader relevance of some type-theoretic techniques developed recently in the study of recursive modules.

show abstract

Section: The Sml/nj Approachmentioning

confidence: 99%

Principal Type Schemes for Modular Programs

Dreyer

Blume

2007

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…Various conditions may be imposed to ensure that the interpretation of polymorphic operations is parametric, by requiring f A,i and f A,i to be appropriately related for different type variable instantiations i, i . Axioms contain (universal) quantifiers for type variables in addition to quantifiers for ordinary variables, as in System F [GLT89]; alternatively, type-variable quantification may be left implicit, as in Extended ML [KST97].…”

Section: Polymorphic Typesmentioning

confidence: 99%

Algebraic Preliminaries

2002

Courant Lecture Notes

View full text Add to dashboard Cite

“…One example of such a constructor is the functor Sort ∈ Mod (ELEMSPEC → SORTELEMSPEC), presented in Example 3.5. Constructor specifications correspond to functor specifications in Extended ML, see [KST97].…”

mentioning

confidence: 99%

Horizontal Composability Revisited

Sannella

Tarlecki

2006

Algebra, Meaning, and Computation

Self Cite

View full text Add to dashboard Cite

Abstract. We recall the contribution of Goguen and Burstall's 1980 CAT paper and its powerful influence on theories of specification implementation that were emerging at about the same time, via the introduction of the notions of vertical and horizontal composition of implementations. We then give a different view of implementation which we believe provides a more adequate reflection of the rather subtle interplay between implementation, specification structure and program structure.

show abstract

The definition of Extended ML: A gentle introduction

Cited by 61 publications

References 8 publications

Principal Type Schemes for Modular Programs

Principal Type Schemes for Modular Programs

Algebraic Preliminaries

Horizontal Composability Revisited

Contact Info

Product

Resources

About