1ML – core and modules united (F-ing first-class modules)

RossbergAndreas,

doi:10.1145/2858949.2784738

Cited by 3 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Существует также подход, объединяющий записи и модули в одно целое[Rossberg, 2015]. Это вариант языка ML, в котором записи, а также кортежи и структуры, задаются как вариант одной и той же формы -модуля.…”

unclassified

On Type-Theoretical Formalization of Situation Semantics

Domanov

2021

View full text Add to dashboard Cite

Situation semantics is an effective instrument for analysing semantical aspects of natural languages with explicit dependence on contexts, like referential opacity of belief contexts etc. Making use of type-theoretical approaches not only makes its formalism more practical in many ways, but also facilitates its migration to computer systems, specifically, the formalization in functional programming languages. The article deals with a prototype of the type theoretical language of situation semantics, implemented on the basis of the language Racket. It decribes principal approaches, methods of solving some problems of formal semantics as well as issues that need to be addressed.

show abstract

unclassified

On Type-Theoretical Formalization of Situation Semantics

Domanov

2021

View full text Add to dashboard Cite

show abstract

A focused solution to the avoidance problem

Crary¹

2020

J. Funct. Prog.

View full text Add to dashboard Cite

In ML-style module type theory, sealing often leads to situations in which type variables must leave scope, and this creates a need for signatures that avoid such variables. Unfortunately, in general, there is no best signature that avoids a variable, so modules do not always enjoy principal signatures. This observation is called the avoidance problem. In the past, the problem has been circumvented using a variety of devices for moving variables so they can remain in scope. These devices work, but have heretofore lacked a logical foundation. They have also lacked a presentation in which the dynamic semantics is given on the same phrases as the static semantics, which limits their applications. We can provide a best supersignature avoiding a variable by fiat, by adding an existential signature that is the least upper bound of its instances. This idea is old, but a workable metatheory has not previously been worked out. This work resolves the metatheoretic issues using ideas borrowed from focused logic. We show that the new theory results in a type discipline very similar to the aforementioned devices used in prior work. In passing, this gives a type-theoretic justification for the generative stamps used in the early days of the static semantics of ML modules. All the proofs are formalized in Coq.

show abstract

The history of Standard ML

MacQueen

Harper

Reppy

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

The ML family of strict functional languages, which includes F#, OCaml, and Standard ML, evolved from the Meta Language of the LCF theorem proving system developed by Robin Milner and his research group at the University of Edinburgh in the 1970s. This paper focuses on the history of Standard ML, which plays a central role in this family of languages, as it was the first to include the complete set of features that we now associate with the name “ML” (i.e., polymorphic type inference, datatypes with pattern matching, modules, exceptions, and mutable state). Standard ML, and the ML family of languages, have had enormous influence on the world of programming language design and theory. ML is the foremost exemplar of a functional programming language with strict evaluation (call-by-value) and static typing. The use of parametric polymorphism in its type system, together with the automatic inference of such types, has influenced a wide variety of modern languages (where polymorphism is often referred to as generics ). It has popularized the idea of datatypes with associated case analysis by pattern matching. The module system of Standard ML extends the notion of type-level parameterization to large-scale programming with the notion of parametric modules, or functors . Standard ML also set a precedent by being a language whose design included a formal definition with an associated metatheory of mathematical proofs (such as soundness of the type system). A formal definition was one of the explicit goals from the beginning of the project. While some previous languages had rigorous definitions, these definitions were not integral to the design process, and the formal part was limited to the language syntax and possibly dynamic semantics or static semantics, but not both. The paper covers the early history of ML, the subsequent efforts to define a standard ML language, and the development of its major features and its formal definition. We also review the impact that the language had on programming-language research.

show abstract

1ML – core and modules united (F-ing first-class modules)

Cited by 3 publications

References 33 publications

On Type-Theoretical Formalization of Situation Semantics

On Type-Theoretical Formalization of Situation Semantics

A focused solution to the avoidance problem

The history of Standard ML

Contact Info

Product

Resources

About