Abstract
The problem of putting consistent theories together in institutions is discussed. A general necessary condition for consistency of the resulting theory is carried out, and some sufficient conditions are given for diagrams of theories in which shapes are tree bundles or directed graphs. Moreover, some transformations from complicated cases to simple ones are established.
Similar content being viewed by others
References
Goguen J A, Burstall R M. Institutions: Abstract model theory for specification and programming.JACM, 1992, 39 (1): 95–146.
Diaconescu R, Goguen J, Stefaneas P. Logical support for modularization. Slightly revised version of a paper to appear in Proceedings of a Workshop on Logical Frameworks (Edinburg, May 1991), edited by Huet G, Plotkin G. Revision of 24 March 1993.
Tarlecki A. Bits and pieces of the theory of institutions. InProc Summer Workshop on Category Theory and Computer Programming (Pitt D, Abramsky S, Poigne A, Rydeheard D eds.), Lecture Notes in Computer Science 240, Springer-Verlag, New York, 1986, 334–360.
Author information
Authors and Affiliations
Additional information
Supported by the National Research and Development Project of High-Technology.
For the bibliography ofYing Mingsheng, please see p. 273 of this issue.
Rights and permissions
About this article
Cite this article
Ying, M. Putting consistent theories together in institutions. J. of Compt. Sci. & Technol. 10, 260–266 (1995). https://doi.org/10.1007/BF02943493
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02943493