{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:50:50Z","timestamp":1762458650474},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540799795"},{"type":"electronic","value":"9783540799801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79980-1_7","type":"book-chapter","created":{"date-parts":[[2008,7,28]],"date-time":"2008-07-28T15:55:42Z","timestamp":1217260542000},"page":"83-99","source":"Crossref","is-referenced-by-count":9,"title":["Calculating Invariants as Coreflexive Bisimulations"],"prefix":"10.1007","author":[{"given":"Lu\u00eds S.","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 N.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Category Theory and Computer Science, London, UK, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"issue":"1\u20132","key":"7_CR2","first-page":"153","volume":"15","author":"K. Backhouse","year":"2004","unstructured":"Backhouse, K., Backhouse, R.C.: Safety of abstract interpretations for free, via logical relations and Galois connections. SCP\u00a015(1\u20132), 153\u2013196 (2004)","journal-title":"SCP"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-47797-7_4","volume-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Constuction","author":"R. Backhouse","year":"2002","unstructured":"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.\u00a02297, pp. 89\u2013148. Springer, Heidelberg (2002)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11783596_7","volume-title":"Mathematics of Program Construction","author":"R. Backhouse","year":"2006","unstructured":"Backhouse, R., Michaelis, D.: Exercises in quantifier manipulation. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol.\u00a04014, pp. 70\u201381. Springer, Heidelberg (2006)"},{"key":"7_CR5","first-page":"303","volume-title":"AMAST 1991","author":"R.C. Backhouse","year":"1992","unstructured":"Backhouse, R.C., de Bruin, P., Hoogendijk, P., Malcolm, G., Voermans, T.S., van der Woude, J.: Polynomial relators. In: AMAST 1991, pp. 303\u2013362. Springer, Heidelberg (1992)"},{"issue":"4\/5","key":"7_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1051\/ita:1999126","volume":"33","author":"R.C. Backhouse","year":"1999","unstructured":"Backhouse, R.C., Hoogendijk, P.F.: Final dialgebras: From categories to allegories. Informatique Theorique et Applications\u00a033(4\/5), 401\u2013426 (1999)","journal-title":"Informatique Theorique et Applications"},{"key":"7_CR7","series-title":"Series in Computer Science","volume-title":"Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Hoare, C.A.R.(series ed.). Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1997), \n                  \n                    http:\/\/www.phptr.com\/ptrbooks\/ptr_013507245x.html"},{"key":"7_CR8","unstructured":"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)"},{"key":"7_CR9","series-title":"Mathematical Library","volume-title":"Categories, Allegories","author":"P.J. Freyd","year":"1990","unstructured":"Freyd, P.J., \u0160\u010dedrov, A.: Categories, Allegories. Mathematical Library, vol.\u00a039. North-Holland, Amsterdam (1990)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.2307\/2273967","volume":"51","author":"W.S. Hatcher","year":"1986","unstructured":"Hatcher, W.S.: Review: Peter Aczel. Frege structures and the notions of proposition, truth and set. The Journal of Symbolic Logic\u00a051(1), 244\u2013246 (1986)","journal-title":"The Journal of Symbolic Logic"},{"key":"7_CR11","unstructured":"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"},{"key":"7_CR12","volume-title":"Systematic Software Development Using VDM","author":"C.B. Jones","year":"1986","unstructured":"Jones, C.B.: Systematic Software Development Using VDM. Prentice-Hall Int., Englewood Cliffs (1986)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01304852","volume":"23","author":"A. Kock","year":"1972","unstructured":"Kock, A.: Strong functors and monoidal monads. Archiv f\u00fcr Mathematik\u00a023, 113\u2013120 (1972)","journal-title":"Archiv f\u00fcr Mathematik"},{"key":"7_CR14","unstructured":"Oliveira, J.N.: Invariants as coreflexive bisimulations \u2014 in a coalgebraic setting, Presentation at the  IFIP WG 2.1 #62 Meeting Namur (December 2006)"},{"key":"7_CR15","unstructured":"Oliveira, J.N.: Pointfree foundations for (generic) lossless decomposition (submitted, 2007)"},{"key":"7_CR16","unstructured":"Oliveira, J.N.: Theory and applications of the PF-transform, Tutorial at LerNET 2008, Piri\u00e0polis, Uruguay (slides available from the author\u2019s website) (February 2008)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11813040_17","volume-title":"FM 2006: Formal Methods","author":"J.N. Oliveira","year":"2006","unstructured":"Oliveira, J.N., Rodrigues, C.J.: Pointfree factorization of operation refinement. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 236\u2013251. Springer, Heidelberg (2006)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","first-page":"561","volume-title":"Concurrency and automata on infinite sequences","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. LNCS, vol.\u00a0104, pp. 561\u2013572. Springer, Heidelberg (1981)"},{"key":"7_CR19","first-page":"248","volume-title":"Proc. of the 7th Annual IEEE Symp. on Logic in Computer Science","author":"V. Pratt","year":"1992","unstructured":"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\u2013254. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"7_CR20","first-page":"513","volume":"83","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. Information Processing 83, 513\u2013523 (1983)","journal-title":"Information Processing"},{"key":"7_CR21","first-page":"1","volume":"11","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Relators and metric bisimulations. ENTCS\u00a011, 1\u20137 (1998)","journal-title":"ENTCS"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-73859-6_29","volume-title":"Algebra and Coalgebra in Computer Science","author":"J.J.M.M. Rutten","year":"2007","unstructured":"Rutten, J.J.M.M.: Coalgebraic foundations of linear systems. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 425\u2013446. Springer, Heidelberg (2007)"},{"key":"7_CR23","series-title":"American Mathematical Society","volume-title":"A Formalization of Set Theory without Variables","author":"A. Tarski","year":"1987","unstructured":"Tarski, A., Givant, S.: A Formalization of Set Theory without Variables. American Mathematical Society, vol.\u00a041. AMS Colloquium Publications, Providence (1987)"},{"key":"7_CR24","unstructured":"Vaccari, M.: Calculational derivation of circuits. PhD thesis, Univ. S. Milano (1998)"},{"key":"7_CR25","volume-title":"4th Int. Symp. on FPLCA","author":"P.L. Wadler","year":"1989","unstructured":"Wadler, P.L.: Theorems for free! In: 4th Int. Symp. on FPLCA, London, September 1989. ACM Press, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79980-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:35:30Z","timestamp":1619523330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79980-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540799795","9783540799801"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79980-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}