{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:40Z","timestamp":1725664420686},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_196","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:11:08Z","timestamp":1330276268000},"page":"202-216","source":"Crossref","is-referenced-by-count":12,"title":["Reasoning about higher-order processes"],"prefix":"10.1007","author":[{"given":"Roberto M.","family":"Amadio","sequence":"first","affiliation":[]},{"given":"Mads","family":"Dam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161\u2013218, 1991.","journal-title":"Information and Computation"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"R. Amadio. On the reduction of chocs bisimulation to \u03c0-calculus bisimulation. In Proc. CONCUR 93, Hildesheim, pages 112\u2013126. SLNCS 715, 1993. Also appeared as Research Report Inria-Lorraine 1786, October 1992.","DOI":"10.1007\/3-540-57208-2_9"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"G. Boudol. Towards a lambda calculus for concurrent and communicating systems. SLNCS, 351, 1989. In Proc. TAPSOFT.","DOI":"10.1007\/3-540-50939-9_130"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-57208-2_3","volume":"715","author":"M. Dam","year":"1993","unstructured":"M. Dam. Model checking mobile processes. In Proc. CONCUR'93, Lecture Notes in Computer Science, 715:22\u201336, 1993. Full version in SICS report RR94:1, 1994.","journal-title":"Proc. CONCUR'93, Lecture Notes in Computer Science"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01491213","volume":"18","author":"A. Giacalone","year":"1989","unstructured":"A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121\u2013160, 1989.","journal-title":"International Journal of Parallel Programming"},{"key":"13_CR6","unstructured":"M. Hennessy. A denotational model for higher-order processes. In Proc. IEEE-LICS, 1993."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"M. Hennessy and X. Liu. A modal logic for message passing processes. Dept. of Computer Science, University of Sussex, Report 3\/93, 1993.","DOI":"10.1007\/3-540-56922-7_30"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137\u2013162, 1985.","journal-title":"Journal of the ACM"},{"key":"13_CR9","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(93)90156-N","volume":"114","author":"R. Milner","year":"1993","unstructured":"R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. TCS, 114:149\u2013171, 1993.","journal-title":"TCS"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"F. Nielsen. The typed lambda calculus with first class processes. Springer Lecture Notes in Computer Science, 366, 1989. In Proc. PARLE.","DOI":"10.1007\/3-540-51285-3_52"},{"key":"13_CR12","unstructured":"A. Pitts and I. Stark. What's new? In Proc. Mathematical Foundations of Computer Science, Gda\u0144sk, Poland. SLNCS 711, 1993."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"J. Reppy. Cml: A higher-order concurrent language. In Proc. ACM-SIGPLAN 91, Conf. on Prog. Lang. Design and Impl., 1991.","DOI":"10.1145\/113445.113470"},{"key":"13_CR14","unstructured":"D. Sangiorgi. Expressing mobility in process algebras: first-order and higher order paradigms. PhD thesis, University of Edinburgh, September 1992."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311\u2013347, 1987.","journal-title":"Theoretical Computer Science"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"C. Stirling. Modal and temporal logics. In Handbook of Logic in Computer Science Vol. 2, Oxford University Press, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0005"},{"key":"13_CR17","volume-title":"PhD thesis","author":"B. Thomsen","year":"1990","unstructured":"B. Thomsen. A calculus of higher order communicating systems. PhD thesis, Imperial College, London, 1990."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B. Thomsen","year":"1993","unstructured":"B. Thomsen. Plain chocs. Acta Informatica, 30:1\u201359, 1993. Also appeared as TR 89\/4, Imperial College, London.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_196.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:28:56Z","timestamp":1713630536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_196","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}