This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Adámek, J. Rosický. Locally Presentable and Accessible Categories. Cambridge University Press, 1994.
E. Astesiano, M. Cerioli. Non-strict don't care algebras and specifications. Mathematical Structures in Comupter Science, 1996. To appear.
M. Bidoit, H.-J. Kreowski, P. Lescannes, F. Orejas, D. Sannella. Algebraic System Specification and Development. A Survey and Annotated Bibliography, Lecture Notes in Computer Science 501. Springer Verlag, 1991.
P. Burmeister. A model theoretic approach to partial algebras. Akademie Verlag, Berlin, 1986.
R. M. Burstall, J. A. Goguen. Putting theories together to make specifications. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, 1045–1058. Cambridge, 1977.
M. Cerioli. Relationships between Logical Formalisms. PhD thesis, TD-4/93, Università di Pisa-Genova-Udine, 1993.
H. Ehrig, B. Mahr. Fundamentals of Algebraic Specification 1. Springer Verlag, Heidelberg, 1985.
J. A. Goguen, R. M. Burstall. A study in the foundations of programming methodology: Specifications, institutions, charters and parchments. In D. Pitt et al., ed., Category Theory and Computer Programming, LNCS 240, 313–333. Springer Verlag, 1985.
J. A. Goguen, R. M. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39, 95–146, 1992. Predecessor in: LNCS 164(1984):221–256.
H. Hilberdink. The end of syntax. The end of algebra. Manuscripts, St. Peter's College, Oxford, 1995.
C. B. Jones. Systematic Software Development Using VDM. Prentice Hall, 1990.
S.C. Kleene. Introduction to Metamathematics. North Holland, 1952.
T. Mossakowski. Equivalences among various logical frameworks of partial algebras. In H. Kleine Büning et al., ed., Computer Science Logic. 9th Workshop, CSL'95. Paderborn, Germany, September 1995. Springer LNCS, 1996. To appear.
D. S. Scott. Identity and existence in intuitionistic logic. In M.P. Fourman, C.J. Mulvey, D.S. Scott, eds., Application of Sheaves, Lecture Notes in Mathematics 753, 660–696. Springer Verlag, 1979.
P. Stefaneas. The first order parchment. Report PRG-TR-16-92, Oxford University Computing Laboratory, 1992.
A. Tarlecki. Working with multiple logical systems. Unpublished manuscript. See http://zls.mimuw.edu.pl/∼tarlecki/book/index.html.
A. Tarlecki. On the existence of free models in abstract algebraic institutions. Theoretical Computer Science 37, 269–304, 1985.
A. Tarlecki. Bits and pieces of the theory of institutions. In D. Pitt, S. Abramsky, A. Poigné, D. Rydeheard, eds., Proc. Intl. Workshop on Category Theory and Computer Programming, Guildford 1985, LNCS 240, 334–363. Springer-Verlag, 1986.
A. Tarlecki, R. M. Burstall, J. A. Goguen. Some fundamentals algebraic tools for the semantics of computation. Part 3: Indexed categories. Theoretical Computer Science 91, 239–264, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mossakowski, T. (1996). Using limits of parchments to systematically construct institutions of partial algebras. In: Haveraaen, M., Owe, O., Dahl, OJ. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1995 1995. Lecture Notes in Computer Science, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61629-2_54
Download citation
DOI: https://doi.org/10.1007/3-540-61629-2_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61629-0
Online ISBN: 978-3-540-70642-7
eBook Packages: Springer Book Archive