{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T21:36:54Z","timestamp":1672609014339},"reference-count":29,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1016\/j.ic.2009.06.005","type":"journal-article","created":{"date-parts":[[2010,1,30]],"date-time":"2010-01-30T09:37:26Z","timestamp":1264844246000},"page":"606-633","source":"Crossref","is-referenced-by-count":23,"title":["Interpreting a finitary pi-calculus in differential interaction nets"],"prefix":"10.1016","volume":"208","author":[{"given":"Thomas","family":"Ehrhard","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Laurent","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2009.06.005_bib1","article-title":"Domains and lambda-calculi","volume":"vol. 46","author":"Amadio","year":"1998"},{"key":"10.1016\/j.ic.2009.06.005_bib2","series-title":"Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science","article-title":"Concurrent games and full completeness","author":"Abramsky","year":"1999"},{"key":"10.1016\/j.ic.2009.06.005_bib3","series-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL)","first-page":"81","article-title":"The chemical abstract machine","author":"Berry","year":"1990"},{"key":"10.1016\/j.ic.2009.06.005_bib4","unstructured":"Emmanuel Beffara, Logique, R\u00e9alisabilit\u00e9 et Concurrence, Ph.D. thesis, Universit\u00e9 Denis Diderot, 2005."},{"key":"10.1016\/j.ic.2009.06.005_bib5","series-title":"Proceedings of the 21st Annual Conference of the European Association for Computer Science Logic (CSL\u201907)","article-title":"Not enough points is enough","author":"Bucciarelli","year":"2007"},{"key":"10.1016\/j.ic.2009.06.005_bib6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","article-title":"Strong normalisability in the pi-calculus","volume":"191","author":"Berger","year":"2004","journal-title":"Information and Computation"},{"issue":"3","key":"10.1016\/j.ic.2009.06.005_bib7","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.tcs.2006.02.009","article-title":"Concurrent nets: a study of prefixing in process calculi","volume":"356","author":"Beffara","year":"2006","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2009.06.005_bib8","unstructured":"Pierre-Louis Curien, Claudia Faggian, An approach to innocent strategies as graphs, Technical Report hal-00155293, CCSD-HAL, submitted for publication. Available from: ."},{"issue":"3","key":"10.1016\/j.ic.2009.06.005_bib9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01622878","article-title":"The structure of multiplicatives","volume":"28","author":"Danos","year":"1989","journal-title":"Archives for Mathematical Logic"},{"issue":"4","key":"10.1016\/j.ic.2009.06.005_bib10","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1017\/S0960129504004645","article-title":"Finiteness spaces","volume":"15","author":"Ehrhard","year":"2005","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.ic.2009.06.005_bib11","unstructured":"Thomas Ehrhard, Olivier Laurent, Acyclic solos and differential interaction nets, Logical Methods in Computer Science, submitted for publication."},{"issue":"2","key":"10.1016\/j.ic.2009.06.005_bib12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.tcs.2006.08.003","article-title":"Differential interaction nets","volume":"364","author":"Ehrhard","year":"2006","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.ic.2009.06.005_bib13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0168-0072(96)00024-3","article-title":"Completeness results for linear logic on Petri nets","volume":"86","author":"Engberg","year":"1997","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.ic.2009.06.005_bib14","series-title":"Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science","first-page":"376","article-title":"Ludics nets, a game model of concurrent interaction","author":"Faggian","year":"2005"},{"key":"10.1016\/j.ic.2009.06.005_bib15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2009.06.005_bib16","series-title":"Proceedings of COLOG\u201988","first-page":"76","article-title":"Geometry of interaction II: deadlock free algorithm","volume":"vol. 417","author":"Girard","year":"1988"},{"key":"10.1016\/j.ic.2009.06.005_bib17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0168-0072(88)90025-5","article-title":"Normal functors, power series and the \u03bb-calculus","volume":"37","author":"Girard","year":"1988","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.ic.2009.06.005_bib18","unstructured":"Kohei Honda, Olivier Laurent, An exact correspondence between a typed pi-calculus and polarised proof-nets, Theoretical Computer Science, submitted for publication."},{"key":"10.1016\/j.ic.2009.06.005_bib19","series-title":"Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"348","article-title":"Combinatory representation of mobile processes","author":"Honda","year":"1994"},{"key":"10.1016\/j.ic.2009.06.005_bib20","series-title":"Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Table","first-page":"38","article-title":"Bigraphs and transitions","author":"Jensen","year":"2003"},{"key":"10.1016\/j.ic.2009.06.005_bib21","series-title":"Advances in Linear Logic","article-title":"From proof nets to interaction nets","author":"Lafont","year":"1995"},{"key":"10.1016\/j.ic.2009.06.005_bib22","series-title":"Proceedings of the 4th Conference on Theoretical Aspects of Computer Science, TACS\u201901","article-title":"Solo diagrams","volume":"vol. 2215","author":"Laneve","year":"2001"},{"issue":"5","key":"10.1016\/j.ic.2009.06.005_bib23","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1017\/S0960129503004055","article-title":"Solos in concert","volume":"13","author":"Laneve","year":"2003","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/j.ic.2009.06.005_bib24","first-page":"21","article-title":"Multiport interaction nets and concurrency","volume":"vol. 3653","author":"Mazza","year":"2005"},{"issue":"2","key":"10.1016\/j.ic.2009.06.005_bib25","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","article-title":"Asynchronous games 2: the true concurrency of innocence","volume":"358","author":"Melli\u00e8s","year":"2006","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2009.06.005_bib26","series-title":"Logic and Algebra of Specification","first-page":"203","article-title":"The polyadic pi-calculus: a tutorial","author":"Milner","year":"1993"},{"issue":"3","key":"10.1016\/j.ic.2009.06.005_bib27","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/j.ic.2009.06.005_bib28","unstructured":"Laurent Regnier, Lambda-Calcul et R\u00e9seaux. Th\u00e8se de doctorat, Universit\u00e9 Paris 7, January 1992."},{"key":"10.1016\/j.ic.2009.06.005_bib29","series-title":"The pi-Calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540110000155?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540110000155?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T14:57:48Z","timestamp":1544713068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540110000155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0890540110000155"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2009.06.005","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}