{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:15Z","timestamp":1720625535961},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,3,13]],"date-time":"2014-03-13T00:00:00Z","timestamp":1394668800000},"content-version":"vor","delay-in-days":4089,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003]]},"DOI":"10.1016\/s1571-0661(03)50008-1","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T00:32:50Z","timestamp":1395102770000},"page":"149-168","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Contextual Equivalence for Higher-Order \u03c0-Calculus Revisited"],"prefix":"10.1016","volume":"83","author":[{"given":"Alan","family":"Jeffrey","sequence":"first","affiliation":[]},{"given":"Julian","family":"Rathke","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(03)50008-1_bb0005","series-title":"Proc. FoSSaCS \u201998, LNGS","article-title":"Mobile ambients","author":"Cardelli","year":"1998"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0010","series-title":"Proc. CONCUR, volume 1119 of Lecture notes in computer science","article-title":"A calculus of mobile agents","author":"Fournet","year":"1996"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0015","series-title":"Proceedings TAPSOFT89 conference, volume 352 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-50940-2_36","article-title":"Facile: A symmetric integration of concurrent and functional programming","author":"Giacalone","year":"1989"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0020","series-title":"Proceedings Computing: the Australasian Theory Symposium CATS 2002, Electronic notes in theoretical computer science","article-title":"Typed behavioural equivalences for processes in the presence of subtyping","author":"Hennessy","year":"2002"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0025","series-title":"Proc. LICS2000, 15th Annual Symposium on Logic in Computer Science, Santa Barbara","first-page":"311","article-title":"A theory of bisimulation for a fragment of concurrent ml with local names","author":"Jeffrey","year":"2000"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0030","series-title":"Proc. Lics2002, 17th Annual Symposium on Logic in Computer Science, Copenhagen","first-page":"101","article-title":"A fully abstract may testing semantics for concurrent objects","author":"Jeffrey","year":"2002"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0035","series-title":"Proc. POPL","article-title":"A typed language for distributed mobile processes","author":"Riely","year":"1998"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0040","series-title":"Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms","author":"Sangiorgi","year":"1993"},{"issue":"2","key":"10.1016\/S1571-0661(03)50008-1_bb0045","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/inco.1996.0096","article-title":"Bisimulation for higher-order process calculi","volume":"131","author":"Sangiorgi","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0050","series-title":"The pi-calculus: A Theory of mobile processes","author":"Sangiorgi","year":"2001"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0055","series-title":"Calculi for Higher-Order Communicating Systems","author":"Thomsen","year":"1990"},{"key":"10.1016\/S1571-0661(03)50008-1_bb0060","series-title":"Internet Programming Languages, volume 1686 of LNCS","article-title":"Seal: A framework for secure mobile computations","author":"Vitek","year":"1999"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"pt","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066103500081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066103500081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T01:50:45Z","timestamp":1538790645000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066103500081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":12,"alternative-id":["S1571066103500081"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(03)50008-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}