{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:32Z","timestamp":1725491612648},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_23","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"333-348","source":"Crossref","is-referenced-by-count":6,"title":["Interpreting a Finitary Pi-calculus in Differential Interaction Nets"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Ehrhard","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Laurent","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511983504","volume-title":"Domains and lambda-calculi","author":"R. Amadio","year":"1998","unstructured":"Amadio, R., Curien, P.-L.: Domains and lambda-calculi. Cambridge Tracts in Theoretical Computer Science, vol.\u00a046. Cambridge University Press, Cambridge (1998)"},{"key":"23_CR2","volume-title":"Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science","author":"S. Abramsky","year":"1999","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"23_CR3","unstructured":"Beffara, E.: Logique, R\u00e9alisabilit\u00e9 et Concurrence. PhD thesis, Universit\u00e9 Denis Diderot (2005)"},{"key":"23_CR4","unstructured":"Berger, M., Honda, K., Yoshida, N.: Strong normalisability in the pi-calculus. Information and Computation (2003) (to appear)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Beffara, E., Maurel, F.: Concurrent nets: a study of prefixing in process calculi, vol. 356. Theoretical Computer Science (2005)","DOI":"10.1016\/j.tcs.2006.02.009"},{"key":"23_CR6","unstructured":"Curien, P.-L., Faggian, C.: An approach to innocent strategies as graphs. Technical report, Preuves, Programmes et Syst\u00e8mes, Submitted for publication (2006)"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1017\/S0960129504004645","volume":"15","author":"T. Ehrhard","year":"2005","unstructured":"Ehrhard, T.: Finiteness spaces. Mathematical Structures in Computer Science\u00a015(4), 615\u2013646 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"23_CR8","unstructured":"Ehrhard, T., Laurent, O.: Acyclic solos (submitted, 2007)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Regnier, L.: Differential interaction nets. Theoretical Computer Science (2006) (to appear)","DOI":"10.1016\/j.tcs.2006.08.003"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0168-0072(96)00024-3","volume":"86","author":"U. Engberg","year":"1997","unstructured":"Engberg, U., Winskel, G.: Completeness results for linear logic on petri nets. Annals of Pure and Applied Logic\u00a086(2), 101\u2013135 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"23_CR11","first-page":"376","volume-title":"Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science","author":"C. Faggian","year":"2005","unstructured":"Faggian, C., Maurel, F.: Ludics nets, a game model of concurrent interaction. In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, pp. 376\u2013385. IEEE Computer Society, Los Alamitos (2005)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0168-0072(88)90025-5","volume":"37","author":"J.-Y. Girard","year":"1988","unstructured":"Girard, J.-Y.: Normal functors, power series and the \u03bb-calculus. Annals of Pure and Applied Logic\u00a037, 129\u2013177 (1988)","journal-title":"Annals of Pure and Applied Logic"},{"key":"23_CR14","unstructured":"Honda, K., Laurent, O.: An exact correspondence between a typed \u03c0-calculus and polarized proof-nets (2007) (in preparation)"},{"key":"23_CR15","unstructured":"Jensen, O., Milner, R.: Bigraphs and mobile processes (revised). Technical report, Cambridge University Computer Laboratory (2004)"},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1017\/CBO9780511629150.012","volume-title":"Advances in Linear Logic","author":"Y. Lafont","year":"1995","unstructured":"Lafont, Y.: From proof nets to interaction nets. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 225\u2013247. Cambridge University Press, Cambridge (1995), Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45500-0_6","volume-title":"Theoretical Aspects of Computer Software","author":"C. Laneve","year":"2001","unstructured":"Laneve, C., Parrow, J., Victor, B.: Solo diagrams. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, Springer, Heidelberg (2001)"},{"issue":"5","key":"23_CR18","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/S0960129503004055","volume":"13","author":"C. Laneve","year":"2003","unstructured":"Laneve, C., Victor, B.: Solos in concert. Mathematical Structures in Computer Science\u00a013(5), 657\u2013683 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11539452_6","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"D. Mazza","year":"2005","unstructured":"Mazza, D.: Multiport interaction nets and concurrency. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 21\u201335. Springer, Heidelberg (2005)"},{"issue":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"P.-A. Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 2: the true concurrency of innocence. Theoretical Computer Science\u00a0358(2), 200\u2013228 (2006)","journal-title":"Theoretical Computer Science"},{"key":"23_CR21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-58041-3_6","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic pi-calculus: a tutorial. In: Logic and Algebra of Specification, pp. 203\u2013246. Springer, Heidelberg (1993)"},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. Plotkin","year":"1976","unstructured":"Plotkin, G.: A powerdomain construction. SIAM Journal of Computing\u00a05(3), 452\u2013487 (1976)","journal-title":"SIAM Journal of Computing"},{"key":"23_CR23","unstructured":"Regnier, L.: Lambda-Calcul et R\u00e9seaux. Th\u00e8se de doctorat, Universit\u00e9 Paris 7 (January 1992)"},{"key":"23_CR24","volume-title":"The pi-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The pi-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:03Z","timestamp":1619519103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}