{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:26:12Z","timestamp":1784255172614,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540784975","type":"print"},{"value":"9783540784999","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78499-9_24","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"334-349","source":"Crossref","is-referenced-by-count":6,"title":["RPO, Second-Order Contexts, and \u03bb-Calculus"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Di Gianantonio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Furio","family":"Honsell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Ong, L.: Full Abstraction in the Lazy Lambda Calculus. Information and Computation\u00a0105(2), 159\u2013267 (1993)","journal-title":"Information and Computation"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Konig, B., Montanari, U.: Saturated Semantics for Reactive Systems. In: LICS (2006)","DOI":"10.1109\/LICS.2006.46"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11841883_13","volume-title":"Graph Transformations","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., Gadducci, F., Konig, B.: Process Bisimulation via a Graphical Encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 168\u2013183. Springer, Heidelberg (2006)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, Second-order Contexts, and \u03bb-calculus, Extended version (2008), www.dimi.uniud.it\/pietro\/papers\/socl.pdf","DOI":"10.1007\/978-3-540-78499-9_24"},{"issue":"2","key":"24_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L. Egidi","year":"1992","unstructured":"Egidi, L., Honsell, F., Ronchi Della Rocca, S.: Operational, Denotational and Logical Descriptions: A Case Study. Fundamenta Inf.\u00a016(2), 149\u2013169 (1992)","journal-title":"Fundamenta Inf."},{"issue":"6","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1017\/S096012950600569X","volume":"16","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structure in Computer Science\u00a016(6), 1133\u20131163 (2006)","journal-title":"Mathematical Structure in Computer Science"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/11601548_9","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"F. Gadducci","year":"2005","unstructured":"Gadducci, F., Montanari, U.: Observing Reductions in Nominal Calculi via a Graphical Encoding of Processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 106\u2013126. Springer, Heidelberg (2005)"},{"key":"24_CR8","volume-title":"Introduction to combinators and l-calculus","author":"R. Hindley","year":"1986","unstructured":"Hindley, R., Seldin, J.: Introduction to combinators and l-calculus. Cambridge University Press, Cambridge (1986)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/11548133_2","volume-title":"Algebra and Coalgebra in Computer Science","author":"B. Klin","year":"2005","unstructured":"Klin, B., Sassone, V., Sobocinski, P.: Labels from reductions: Towards a general theory. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 30\u201350. Springer, Heidelberg (2005)"},{"key":"24_CR10","unstructured":"Leifer, J.: Operational congruences for reactive systems, PhD thesis, University of Cambridge Computer Laboratory (2001)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J. Leifer","year":"2000","unstructured":"Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R.: Local bigraphs and confluence: Two conjectures. In: Proc. Express 2006. ENTCS, vol.\u00a0175, pp. 65\u201373 (2007)","DOI":"10.1016\/j.entcs.2006.07.035"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-36576-1_26","volume-title":"Foundations of Software Science and Computational Structures","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Sobocinski, P.: Deriving bisimulation congruences: 2-categories vs precategories. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 409\u2013424. Springer, Heidelberg (2003)"},{"key":"24_CR14","first-page":"311","volume-title":"LICS 2005","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Sobocinski, P.: Reactive systems over cospans. In: LICS 2005, pp. 311\u2013320. IEEE, Los Alamitos (2005)"},{"issue":"1\u20132","key":"24_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(00)00309-1","volume":"274","author":"P. Sewell","year":"2002","unstructured":"Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science\u00a0274(1\u20132), 183\u2013230 (2002)","journal-title":"Theoretical Computer Science"},{"key":"24_CR16","unstructured":"Sobocinski, P.: Deriving process congruences from reduction rules, PhD thesis, University of Aarhus (2004)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T00:50:13Z","timestamp":1630975813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540784975","9783540784999"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}