{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:47:36Z","timestamp":1784206056855,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153747","type":"print"},{"value":"9783642153754","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_33","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T14:04:18Z","timestamp":1282313058000},"page":"478-493","source":"Crossref","is-referenced-by-count":56,"title":["Reversing Higher-Order Pi"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Lanese","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Bernard","family":"Stefani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"The Lambda Calculus \u2013 Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus \u2013 Its Syntax and Semantics. North-Holland, Amsterdam (1984)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bennett, C.H.: Notes on the history of reversible computation. IBM Journal of Research and Development\u00a032(1) (1988)","DOI":"10.1147\/rd.321.0016"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the \u03c0-calculus. Acta Informatica\u00a035(5) (1998)","DOI":"10.1007\/s002360050124"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nord. J. Comput.\u00a010(2) (2003)","DOI":"10.1016\/S1571-0661(05)80361-5"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V. Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V. Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 398\u2013412. Springer, Heidelberg (2005)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Danos, V., Krivine, J., Sobocinski, P.: General reversibility. Electr. Notes Theor. Comput. Sci.\u00a0175(3) (2007)","DOI":"10.1016\/j.entcs.2006.07.036"},{"key":"33_CR8","unstructured":"Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: 23rd ACM Symp. on Princ. of Prog. Languages, POPL (1996)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci.\u00a0373(3) (2007)","DOI":"10.1016\/j.tcs.2006.12.019"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program.\u00a073(1-2) (2007)","DOI":"10.1016\/j.jlap.2006.11.002"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation\u00a0131(2) (1996)","DOI":"10.1006\/inco.1996.0096"},{"key":"33_CR12","volume-title":"The \u03c0-calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:19:34Z","timestamp":1558286374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}