{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:15Z","timestamp":1725460035356},"publisher-location":"Boston","reference-count":16,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_40","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"521-534","source":"Crossref","is-referenced-by-count":3,"title":["New-HOPLA a higher-order process language with name generation"],"prefix":"10.1007","author":[{"given":"Glynn","family":"Winskel","sequence":"first","affiliation":[]},{"given":"Francesco Zappa","family":"Nardelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In Proc. TAPSOFT\u2019 89, volume 351 of LNCS, pages 149\u2013161. Springer Verlag, 1989.","DOI":"10.1007\/3-540-50939-9_130"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"G. L. Cattani, I. Stark, and G. Winskel. Presheaf models for the \u03c0-calculus. In Proc. CTCS\u201997, volume 1290 of LNCS. Springer Verlag, 1997.","DOI":"10.1007\/BFb0026984"},{"key":"40_CR3","unstructured":"M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model forthe \u03c0-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996."},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"J.Y. Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"40_CR5","unstructured":"A. D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of CS, University of Aarhus, July 1995."},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D. J. Howe","year":"1996","unstructured":"D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103\u2013112, 1996.","journal-title":"Information and Computation"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"M. Nygaard and G. Winskel. Hopla\u2014a higher-order process language. In Proc. CONCUR\u2019 02, volume 2421 of LNCS. Springer Verlag, 2002.","DOI":"10.1007\/3-540-45694-5_29"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"M. Nygaard and G. Winskel. Domain theory for concurrency. To appear in Theoretical Computer Science, special issue on domain theory, accepted 2003.","DOI":"10.7146\/brics.v10i43.21815"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"M. Nygaard and G. Winskel. Full abstraction for HOPLA. In Proc. CONCUR\u2019 03, LNCS. Springer Verlag, 2003.","DOI":"10.1007\/978-3-540-45187-7_25"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. Operationally-based theories of program equivalence. In P. Dybjer and A. M. Pitts, editors, Semantics and Logics of Computation, Publications of the Newton Institute, pages 241\u2013298. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511526619.007"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Proc. UPC 2000, volume 1837 of LNCS. Springer Verlag, 2000.","DOI":"10.1007\/10722010_15"},{"key":"40_CR12","unstructured":"D. Sangiorgi. Bisimulation in higher-order calculi. In Proc. IFIP PROCOMET\u201994, pages 207\u2013224. North-Holland, 1994."},{"key":"40_CR13","unstructured":"D. Sangiorgi and D. Walker. The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001."},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"I. Stark. A fully-abstract domain model for the \u03c0-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561301"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990.","DOI":"10.1145\/75277.75290"},{"key":"40_CR16","unstructured":"F. Zappa Nardelli. De la s\u00e9mantique des processus d\u2019ordre sup\u00e9rieur. PhD thesis, Universit\u00e9 de Paris 7, 2003. Available in English from http:\/\/www.di.ens.fr\/R~zappa ."}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:21Z","timestamp":1619555301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_40","relation":{},"subject":[]}}