4 Institutions: An Abstract Framework for Formal Specifications

Data Types, volume 655 of Lecture Notes in Computer Sci-ence, pages 66–91. Springer, 1993.[Mos96] T. Mossakowski. Using limits of parchments to systematically con-struct institutions of partial algebras. In M. Haveraaen, O.-J. Dahl,and O. Owe, editors, Recent Trends in Data Type Specifications. Se-lected Papers, 11th Workshop on Specification of Abstract Data TypesADT’95, volume 1130 of Lecture Notes in Computer Science, pages379–393. Springer, 1996.[MPT97] T. Mossakowski, W. Paw lowski, and A. Tarlecki. Combining and rep-resenting logical systems. In Proc. 7th Intl. Conference on CategoryTheory and Computer Science CTCS’97, volume 1290 of Lecture Notesin Computer Science, pages 177–198. Springer, 1997.[MT92] K. Meinke and J. Tucker. Universal algebra. In S. Abramsky, D. Gab-bay, and T. Maibaum, editors, Handbook of Logic in Computer Science,Vol. 1, pages 189–411. Oxford University Press, 1992.[MTW88] B. Möller, A. Tarlecki, and M. Wirsing. Algebraic specifications of reachable higher-order algebras. In Recent Trends in Data Type Specification, Selected Papers from the 5th Workshop on Specification of Abstract Data Types, volume 332 of Lecture Notes in Computer Sci-Data Types, volume 332 of Lecture Notes in Computer Science, pages 154–169. Springer, 1988.[Nip86] T. Nipkow. Non-deterministic data types: models and implementations. Acta Informatica, 22:629–661, 1986.[Pau96] L.C. Paulson. ML for the Working Programmer. Cambridge University Press, 2nd edition, 1996.[Poi84] A. Poigné. Another look at parameterization using algebraic specifications with subsorts. In Proc. 11th Symp. on Mathematical Foundations of Computer Science, volume 176 of Lecture Notes in Computer Sci-ence, pages 471–479. Springer, 1984.