{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T11:40:32Z","timestamp":1789904432576,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370748","type":"print"},{"value":"9783642370755","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_10","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:37:23Z","timestamp":1361198243000},"page":"145-160","source":"Crossref","is-referenced-by-count":10,"title":["Preorders on Monads and Coalgebraic Simulations"],"prefix":"10.1007","author":[{"given":"Shin-ya","family":"Katsumata","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tetsuya","family":"Sato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","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: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-22944-2_7","volume-title":"Algebra and Coalgebra in Computer Science","author":"A. Balan","year":"2011","unstructured":"Balan, A., Kurz, A.: Finitary Functors: From Set to Preord and Poset. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 85\u201399. Springer, Heidelberg (2011)"},{"key":"10_CR3","series-title":"LNM","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0060439","volume-title":"Reports of the Midwest Category Seminar IV","author":"M. Barr","year":"1970","unstructured":"Barr, M.: Relational Algebras. In: MacLane, S., Applegate, H., Barr, M., Day, B., Dubuc, E., Phreilambud, Pultr, A., Street, R., Tierney, M., Swierczkowski, S. (eds.) Reports of the Midwest Category Seminar IV. LNM, vol.\u00a0137, pp. 39\u201355. Springer, Heidelberg (1970)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45699-6_2","volume-title":"Applied Semantics","author":"N. Benton","year":"2002","unstructured":"Benton, N., Hughes, J., Moggi, E.: Monads and Effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol.\u00a02395, pp. 42\u2013122. Springer, Heidelberg (2002)"},{"key":"10_CR5","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (February 2009)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"B\u00edlkov\u00e1, M., Kurz, A., Petrisan, D., Velebil, J.: Relation liftings on preorders and posets. CoRR, abs\/1210.1433 (2012)","DOI":"10.1007\/978-3-642-22944-2_9"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.ic.2005.04.005","volume":"204","author":"C. C\u00eerstea","year":"2006","unstructured":"C\u00eerstea, C.: A modular approach to defining and characterising notions of simulation. Information and Computation\u00a0204(4), 469\u2013502 (2006)","journal-title":"Information and Computation"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-45793-3_37","volume-title":"Computer Science Logic","author":"J. Goubault-Larrecq","year":"2002","unstructured":"Goubault-Larrecq, J., Lasota, S., Nowak, D.: Logical Relations for Monadic Types. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 553\u2013568. Springer, Heidelberg (2002)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/11817949_27","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"I. Hasuo","year":"2006","unstructured":"Hasuo, I.: Generic Forward and Backward Simulations. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 406\u2013420. Springer, Heidelberg (2006)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.entcs.2006.06.004","volume":"164","author":"I. Hasuo","year":"2006","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace theory. Electr. Notes Theor. Comput. Sci.\u00a0164(1), 47\u201365 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/BFb0022272","volume-title":"Computer Science Logic","author":"C. Hermida","year":"1995","unstructured":"Hermida, C., Jacobs, B.: An Algebraic View of Structural Induction. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 412\u2013426. Springer, Heidelberg (1995)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C. Hermida","year":"1998","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Inf. Comput.\u00a0145(2), 107\u2013152 (1998)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00176-5","volume":"238","author":"W.H. Hesselink","year":"2000","unstructured":"Hesselink, W.H., Thijs, A.: Fixpoint semantics and simulation. Theor. Comput. Sci.\u00a0238(1-2), 275\u2013311 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR14","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Elsevier (1999)"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S1571-0661(04)80636-4","volume":"82","author":"B. Jacobs","year":"2003","unstructured":"Jacobs, B., Hughes, J.: Simulations in coalgebra. Electr. Notes Theor. Comput. Sci.\u00a082(1), 128\u2013149 (2003)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11538363_8","volume-title":"Computer Science Logic","author":"S. Katsumata","year":"2005","unstructured":"Katsumata, S.: A Semantic Formulation of \u22a4\u2009\u22a4-Lifting and Logical Predicates for Computational Metalanguage. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 87\u2013102. Springer, Heidelberg (2005)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11548133_16","volume-title":"Algebra and Coalgebra in Computer Science","author":"B. Klin","year":"2005","unstructured":"Klin, B.: The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 247\u2013262. Springer, Heidelberg (2005)"},{"key":"10_CR18","unstructured":"Kurz, A.: Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwig-Maximilians-Universit\u00e4t, Munchen (2000)"},{"key":"10_CR19","unstructured":"Levy, P.: Boolean precongruences. Manuscript (2009)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-19805-2_3","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Levy","year":"2011","unstructured":"Levy, P.: Similarity Quotients as Final Coalgebras. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 27\u201341. Springer, Heidelberg (2011)"},{"key":"10_CR21","unstructured":"Lindley, S.: Normalisation by Evaluation in the Compilation of Typed Functional Programming Languages. PhD thesis, University of Edinburgh (2004)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11417170_20","volume-title":"Typed Lambda Calculi and Applications","author":"S. Lindley","year":"2005","unstructured":"Lindley, S., Stark, I.: Reducibility and \u22a4\u2009\u22a4-Lifting for Computation Types. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 262\u2013277. Springer, Heidelberg (2005)"},{"key":"10_CR23","unstructured":"Mitchell, J.: Foundations for Programming Languages. MIT Press (1996)"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129500003066","volume":"10","author":"A. Pitts","year":"2000","unstructured":"Pitts, A.: Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science\u00a010(3), 321\u2013359 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. Logical Methods in Computer Science\u00a07(1) (2011)","DOI":"10.2168\/LMCS-7(1:13)2011"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T04:25:21Z","timestamp":1557548721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}