Abstract
Many computer science applications concern properties which are true of a restricted class of models. We present a couple of constructor-based institutions defined on top of some base institutions by restricting the class of models. We define the proof rules for these logics formalized as institutions, and prove their completeness in the abstract framework of institutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adámek, J., Rosický, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Notes, vol. 189. Cambridge University Press, Cambridge (1994)
Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Brückner, B., Mosses, P.D., Sannella, D., Tarlecki, A.: Casl: the common algebraic specification language. Theor. Comput. Sci. 286(2), 153–196 (2002)
Bidoit, M., Hennicker, R.: Constructor-based observational logic. J. Log. Algebr. Program. 67(1-2), 3–51 (2006)
Bidoit, M., Hennicker, R., Kurz, A.: Observational logic, constructor-based logic, and their duality. Theor. Comput. Sci. 3(298), 471–510 (2003)
Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras. Akademie-Verlag, Berlin (1986)
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
Codescu, M., Gaina, D.: Birkhoff completeness in institutions. Logica Universalis 2(2), 277–309 (2008)
Diaconescu, R.: Institution-independent ultraproducts. Fundamenta Informaticae 55(3-4), 321–348 (2003)
Diaconescu, R., Futatsugi, K.: Logical foundations of CafeOBJ. Theor. Comput. Sci. 285(2), 289–318 (2002)
Găină, D., Futatsugi, K., Ogata, K.: Constructor-based Institutions. Technical report, Japan Advanced Institute of Science and Technology, vol. IS-RR-2009-002, pp. 1–19 (May 29, 2009), http://hdl.handle.net/10119/8177
Găină, D., Petria, M.: Completeness by forcing (submitted)
Goguen, J.A., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39(1), 95–146 (1992)
Goguen, J.A., Diaconescu, R.: An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science 4(3), 363–392 (1994)
Goguen, J.A., Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105(2), 217–273 (1992)
Goguen, J.A., Thatcher, J.W.: Initial algebra semantics. In: Annual Symposium on Switching and Automata Theory, pp. 63–77 (1974)
Tarlecki, A.: Bits and pieces of the theory of institutions. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 334–360. Springer, Heidelberg (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Găină, D., Futatsugi, K., Ogata, K. (2009). Constructor-Based Institutions. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)