Module algebra
- 1 April 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 37 (2) , 335-372
- https://doi.org/10.1145/77600.77621
Abstract
An axiomatic algebraic calculus of modules is given that is based on the operators combination/union, export, renaming, and taking the visible signature . Four different models of module algebra are discussed and compared.Keywords
This publication has 17 references indexed in Scilit:
- Algebraic specification of modules and their basic interconnectionsJournal of Computer and System Sciences, 1987
- Algebraic specifications of computable and semicomputable data typesTheoretical Computer Science, 1987
- Introducing institutionsPublished by Springer Nature ,1984
- Increasing modularity and language-independency in automatically generated compilersScience of Computer Programming, 1983
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization TheoremsSIAM Journal on Computing, 1983
- The completeness of the algebraic specification methods for computable data typesInformation and Control, 1982
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data TypesJournal of the ACM, 1982
- Small specifications for large finite data structuresInternational Journal of Computer Mathematics, 1981
- The semantics of clear, a specification languagePublished by Springer Nature ,1980
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theoryThe Journal of Symbolic Logic, 1957