Equational Reasoning for Linking with First-Class Primitive Modules

Wells, J. B.; Vestergaard, René

doi:10.1007/3-540-46425-5_27

Cited by 37 publications

(57 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its syntax is essentially isomorphic to that of the m-calculus of Wells and Vestergaard [31]. The key difference is a simplified call-by-name semantics, because the more sophisticated semantics (and equational theory) of the m-calculus are irrelevant for the typing issues this paper investigates.…”

Section: The M-calculus Of Mixin Modulesmentioning

confidence: 99%

“…As a programming tool, first-class mixin modules are aimed not only at programming-in-the-large issues such as generic modules and dynamic linking, but also at programming-in-the-small issues, because they combine the features of λ-abstractions (first-class functions), records, environments with mutually recursive definitions, and namespaces [31]. A mixin module consists of named components; some are exports that the module defines for other modules, some are imports to be supplied by other modules, and some are locals, i.e., private to the module.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Makholm

Wells²

2005

Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

A mixin module is a programming abstraction that simultaneously generalizes λ-abstractions, records, and mutually recursive definitions. Although various mixin module type systems have been developed, no one has investigated principal typings or developed type inference for first-class mixin modules, nor has anyone added Milner's let-polymorphism to such a system. This paper proves that typability is NP-complete for the naive approach followed by previous mixin module type systems. Because a λ-calculus extended with record concatenation is a simple restriction of our mixin module calculus, we also prove the folk belief that typability is NP-complete for the naive early type systems for record concatenation.To allow feasible type inference, we present Martini, a new system of simple types for mixin modules with principal typings. Martini is conceptually simple, with no subtyping and a clean and balanced separation between unification-based type inference with type and row variables and constraint solving for safety of linking and field extraction. We have implemented a type inference algorithm and we prove its complexity to be O(n 2 ), or O(n) given a fixed bound on the number of field labels. 1 To prove the complexity, we need to present an algorithm for row unification that may have been implemented by others, but which we could not find written down anywhere. Because Martini has principal typings, we successfully extend it with Milner's let-polymorphism.

show abstract

Section: The M-calculus Of Mixin Modulesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Makholm

Wells²

2005

Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Operators on mixins are adapted from previous works [4,2,26]. The main one is composition: given two mixins e 1 and e 2 , their composition e 1 + e 2 returns a new mixin whose outputs are the concatenation of those of e 1 and e 2 , and whose inputs are the inputs of e 1 or e 2 that have not been filled by any output.…”

Section: An Operational Semantics Of Mixinsmentioning

confidence: 99%

“…As CMS , Wells and Vestergaard's m-calculus [26] is targeted to call-by-name evaluation. Nevertheless, it has a rich equational theory that allows to see MM as a strongly-typed version of the m-calculus specialized to call-by-value plus built-in late binding behavior (encoded in the m-calculus), explicit distinction between mixins and modules, programmer control over the order of evaluation, and a sound and flexible type system.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Call-by-Value Mixin Modules

Hirschowitz

Leroy

Wells³

2004

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

A Calculus with Lazy Module Operators

Ancona

Fagorzi

Zucca

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

Modern programming environments such as those of Java and C# support dynamic loading of software fragments. More in general, we can expect that in the future systems will support more and more forms of interleaving of reconfiguration steps and standard execution steps, where the software fragments composing a program are dynamically changed and/or combined on demand and in different ways. However, existing kernel calculi providing formal foundations for module systems are based on a static view of module manipulation, in the sense that open code fragments can be flexibly combined together, but all module operators must be performed once for all before starting execution of a program, that is, evaluation of a module component. The definition of clean and powerful module calculi supporting lazy module operators, that is, operators which can be performed after the selection of some module component, is still an open problem. Here, we provide an example in this direction (the first at our knowledge), defining an extension of the Calculus of Module Systems [5] where module operators can be performed at execution time and, in particular, are executed on demand, that is, only when needed by the executing program. In other words, execution steps, if possible, take the precedence over reconfiguration steps. The type system of the calculus, which is proved to be sound, relies on a dependency analysis which ensures that execution will never try to access module components which cannot become available by performing reconfiguration steps.

show abstract

Equational Reasoning for Linking with First-Class Primitive Modules

Cited by 37 publications

References 29 publications

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Call-by-Value Mixin Modules

A Calculus with Lazy Module Operators

Contact Info

Product

Resources

About