Abstract
Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to software systems. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as types. An outcome of such a theory is a calculus of invariants’ proof obligation discharge, a fragment of which is presented in the paper.
The approach has two main ingredients: one is that of adopting relations as “first class citizens” in a pointfree reasoning style; the other lies on a synergy found between a relational construct, Reynolds’ relation on functions involved in the abstraction theorem on parametric polymorphism and the coalgebraic account of bisimulations and invariants. This leads to an elegant proof of the equivalence between two different definitions of bisimulation found in coalgebra literature (due to B. Jacobs and Aczel & Mendler, respectively) and to their instantiation to the classical Park-Milner definition popular in process algebra.
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
Aczel, P., Mendler, N.: A final coalgebra theorem. In: Category Theory and Computer Science, London, UK, pp. 357–365. Springer, Heidelberg (1989)
Backhouse, K., Backhouse, R.C.: Safety of abstract interpretations for free, via logical relations and Galois connections. SCP 15(1–2), 153–196 (2004)
Backhouse, R.: Galois connections and fixed point calculus. In: Crole, R., Backhouse, R., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Constuction. LNCS, vol. 2297, pp. 89–148. Springer, Heidelberg (2002)
Backhouse, R., Michaelis, D.: Exercises in quantifier manipulation. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 70–81. Springer, Heidelberg (2006)
Backhouse, R.C., de Bruin, P., Hoogendijk, P., Malcolm, G., Voermans, T.S., van der Woude, J.: Polynomial relators. In: AMAST 1991, pp. 303–362. Springer, Heidelberg (1992)
Backhouse, R.C., Hoogendijk, P.F.: Final dialgebras: From categories to allegories. Informatique Theorique et Applications 33(4/5), 401–426 (1999)
Bird, R., de Moor, O.: Algebra of Programming. Hoare, C.A.R.(series ed.). Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1997), http://www.phptr.com/ptrbooks/ptr_013507245x.html
Carboni, A., Kelly, G., Wood, R.: A 2-categorical approach to change of base and geometric morphisms I. Technical Report 90-1, Dept. of Pure Maths, Univ. Sydney (1990)
Freyd, P.J., Ščedrov, A.: Categories, Allegories. Mathematical Library, vol. 39. North-Holland, Amsterdam (1990)
Hatcher, W.S.: Review: Peter Aczel. Frege structures and the notions of proposition, truth and set. The Journal of Symbolic Logic 51(1), 244–246 (1986)
Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observations. Draft Copy. Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
Jones, C.B.: Systematic Software Development Using VDM. Prentice-Hall Int., Englewood Cliffs (1986)
Kock, A.: Strong functors and monoidal monads. Archiv für Mathematik 23, 113–120 (1972)
Oliveira, J.N.: Invariants as coreflexive bisimulations — in a coalgebraic setting, Presentation at the IFIP WG 2.1 #62 Meeting Namur (December 2006)
Oliveira, J.N.: Pointfree foundations for (generic) lossless decomposition (submitted, 2007)
Oliveira, J.N.: Theory and applications of the PF-transform, Tutorial at LerNET 2008, Piriàpolis, Uruguay (slides available from the author’s website) (February 2008)
Oliveira, J.N., Rodrigues, C.J.: Pointfree factorization of operation refinement. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 236–251. Springer, Heidelberg (2006)
Park, D.: Concurrency and automata on infinite sequences. LNCS, vol. 104, pp. 561–572. Springer, Heidelberg (1981)
Pratt, V.: Origins of the calculus of binary relations. In: Proc. of the 7th Annual IEEE Symp. on Logic in Computer Science, Santa Cruz, CA, pp. 248–254. IEEE Computer Society Press, Los Alamitos (1992)
Reynolds, J.C.: Types, abstraction and parametric polymorphism. Information Processing 83, 513–523 (1983)
Rutten, J.J.M.M.: Relators and metric bisimulations. ENTCS 11, 1–7 (1998)
Rutten, J.J.M.M.: Coalgebraic foundations of linear systems. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 425–446. Springer, Heidelberg (2007)
Tarski, A., Givant, S.: A Formalization of Set Theory without Variables. American Mathematical Society, vol. 41. AMS Colloquium Publications, Providence (1987)
Vaccari, M.: Calculational derivation of circuits. PhD thesis, Univ. S. Milano (1998)
Wadler, P.L.: Theorems for free! In: 4th Int. Symp. on FPLCA, London, September 1989. ACM Press, New York (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbosa, L.S., Oliveira, J.N., Silva, A. (2008). Calculating Invariants as Coreflexive Bisimulations . In: Meseguer, J., Roşu, G. (eds) Algebraic Methodology and Software Technology. AMAST 2008. Lecture Notes in Computer Science, vol 5140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79980-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-79980-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79979-5
Online ISBN: 978-3-540-79980-1
eBook Packages: Computer ScienceComputer Science (R0)