Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types
نویسندگان
چکیده
Mixin modules are a framework for modular programming that supports code parameterization, incremental programming via late binding and redefinitions, and cross-module recursion. In this paper, we develop a language of mixin modules that supports call-by-value evaluation, and formalize a reduction semantics and a sound type system for this language.
منابع مشابه
A Reduction Semantics for Call-by-value Mixin Modules
Mixin modules are a framework for modular programming that supports code parameterization, incremental programming via late binding and redefinitions, and cross-module recursion. In this paper, we develop a language of mixin modules that supports call-by-value evaluation, and formalize a reduction semantics and a sound type system for this language.
متن کاملLazy mixin modules and disciplined effects
Programming languages are expected to support programmer’s effort to structure program code. The ML module system, object systems and mixins are good examples of language constructs promoting modular programming. Among the three, mixins can be thought of as a generalization of the two others in the sense that mixins can incorporate features of ML modules and objects with a set of primitive oper...
متن کاملLazy mixins and disciplined effects
Programming languages are expected to support programmer’s effort to structure program code. The ML module system, object systems and mixins are good examples of language constructs promoting modular programming. Among the three, mixins can be thought of as a generalization of the two others in the sense that mixins can incorporate features of ML modules and objects with a set of primitive oper...
متن کاملMixin modules, modules and extended value binding in a call-by-value setting
ion. Indeed, an expression supposed to be of an abstract type t evaluates to a value of its implementation type, say int for example. The equational theory of types does not contain the equality t = int , and therefore reduction does not preserve types does not hold. For DS , soundness is proved in a non-standard way. First, a new type system is defined, as the initial one, but without type abs...
متن کاملA Theory of Mixin Modules: Algebraic Laws and Reduction Semantics
Received Mixins are modules which may contain deferred components, i.e. components not deened in the module itself; moreover, in contrast to parameterized modules (like ML functors), they can be mutually dependent and allow their deenitions to be overridden. In a preceding paper we have deened syntax and a categorical semantics of a kernel language of mixin modules. Here, we take instead an axi...
متن کامل