Unified algebras and institutions
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 304-312
- https://doi.org/10.1109/lics.1989.39185
Abstract
A framework for algebraic specification of abstract data types is introduced. It involves so-called unified algebras, where sorts are treated as values, so that operations can be applied to sorts as well as to the elements that they classify. An institution for unified algebras is defined and shown to be liberal. However, the ordinary forgetful functor does not forget any values in unified algebras, so the usual data constraints do not have any models. A more forgetful functor is introduced and used to define so-called bounded data constraints, which have the expected models.Keywords
This publication has 12 references indexed in Scilit:
- Unified Algebras and action semanticsPublished by Springer Nature ,2005
- Initially — Restricting algebraic theoriesPublished by Springer Nature ,2005
- Specifications in an arbitrary institutionInformation and Computation, 1988
- Logic programming with polymorphically order-sorted typesLecture Notes in Computer Science, 1988
- A mathematical approach to nondeterminism in data typesACM Transactions on Programming Languages and Systems, 1988
- Non-deterministic data types: models and implementationsActa Informatica, 1986
- Fundamentals of Algebraic Specification 1Published by Springer Nature ,1985
- Characterizing specification languages which admit initial semanticsTheoretical Computer Science, 1984
- Data Types as LatticesSIAM Journal on Computing, 1976
- Categories for the Working MathematicianPublished by Springer Nature ,1971