You are looking at historical revision 18278 of this page. It may differ significantly from its current revision.
static-modules
Description
static-modules is a Scheme implementation of the module system described by Xavier Leroy in the paper A Modular Module System.
Library Procedures
Identifiers
[procedure] (ident? X) -> BOOLReturns #t if X is an identifier, #f otherwise.
[procedure] (ident-name IDENT) -> STRINGReturns the string name associated with the given identifier.
[procedure] (ident-stamp IDENT) -> INTReturns the unique stamp of the given identifier.
[procedure] (ident-create NAME) -> IDENTReturns a fresh identifier associated with the given name.
[procedure] (ident-equal? IDENT IDENT) -> BOOLReturns #t if the stamps of the given identifiers are equal, #f otherwise.
[procedure] (ident-empty) -> IDENVReturns an empty identifier environment.
[procedure] (ident-add IDENT DATA IDENV) -> IDENVAdds the given identifier and associated data to the given identifier environment.
[procedure] (ident-find IDENT IDENV) -> DATALooks up the given identifier in the given identifier environment and returns the associated data, or #f if not found.
Access paths
We refer to named types, values (variables), and modules either by identifier (if we are in the scope of their binding) or via the dot notation, e.g. M.x to refer to component x of module M. Access paths represent both kinds of references.
[procedure] (path? X) -> BOOLReturns #t if X is an access path, #f otherwise.
[procedure] (Pident IDENT) -> PATHReturns a path consisting of the given identifier.
[procedure] (Pdot PATH STRING) -> PATHReturns an access path for the given path and field.
[procedure] (path-equal? PATH PATH) -> BOOLReturns #t if the two given paths are equal, #f otherwise.
Substitutions
[procedure] (subst-add IDENT PATH IDENV) -> IDENVExtends the substition environment with the given identifier and path.
[procedure] (subst-path PATH IDENV) -> PATHApplies the given substitutions to the given path.
[procedure] (subst-identity) -> IDENVReturns an empty substitution environment.
Abstract syntax for the base language
[procedure] (make-core-syntax term? valtype? deftype? kind? make-valtype make-deftype subst-valtype subst-deftype subst-kind)This procedure creates the structure describing base language syntax. The meaning of the fields is as follows:
- term?: predicate for value expressions
- valtype?: predicate for type expressions
- deftype?: predicate for type definitions
- kind?: predicate for the kinds that a type definition can have
- make-valtype: constructor for type expressions
- make-deftype: constructor for type definitions
- subst-valtype: substitution function for type expressions
- subst-deftype: substitution function for type definitions
- subst-kind: substitution function for kinds
Abstract syntax for the module language
[procedure] (make-mod-syntax core)modtype? Signature Functorty modspec? Value_sig Type_sig Module_sig modterm? Modid Structure Functor Mapply Constraint moddef? Value_def Type_def Module_def subst-modtype subst-modspec subst-typedecl
Type-checking the base language
[procedure] make-core-typingType-checking the module language
[procedure] make-mod-typingScoping
This library implements generic scoping pass for the module language. This pass is not described in the article.
Scoping is the act of associating identifiers with their binding location. We assume that the parser generates fresh identifiers each time it encounters an occurrence of a lexical identifier in the program, and stores those fresh identifiers in the abstract syntax tree it constructs. The scoping pass rewrites the abstract syntax tree to use identical identifiers at a binding site and at all its usage sites.
[procedure] st-empty[procedure] st-enter-value
[procedure] st-enter-type
[procedure] st-enter-module
[procedure] st-value-path
[procedure] st-type-path
[procedure] st-module-path
[procedure] st-scope-module
Evaluation
Version History
- 1.0 Initial Release
License
static-modules is based on the code and paper by Xavier Leroy (2000): A modular module system. Journal of Functional Programming, 10, pp 269-303
Copyright 2010 Ivan Raikov and the Okinawa Institute of Science and Technology. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. A full copy of the GPL license can be found at <http://www.gnu.org/licenses/>.