{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:31Z","timestamp":1725487111780},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732273"},{"type":"electronic","value":"9783540732280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73228-0_12","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:57:11Z","timestamp":1184601431000},"page":"148-162","source":"Crossref","is-referenced-by-count":7,"title":["Ludics is a Model for the Finitary Linear Pi-Calculus"],"prefix":"10.1007","author":[{"given":"Claudia","family":"Faggian","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Piccolo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11538363_13","volume-title":"Computer Science Logic","author":"P.-L. Curien","year":"2005","unstructured":"Curien, P.-L., Faggian, C.: L-nets, strategies and proof-nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, Springer, Heidelberg (2005)"},{"key":"12_CR2","unstructured":"Faggian, C.: Linear logic games: Sequential and parallel. draft (2005)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"C. Faggian","year":"2006","unstructured":"Faggian, C., Piccolo, M.: A graph abstract machine describing event structure composition (short paper). In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, Springer, Heidelberg (2006)"},{"key":"12_CR4","unstructured":"Faggian, C., Piccolo, M.: Event structures and linear strategies (submitted)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S096012950100336X","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus solum. Mathematical Structures in Computer Science\u00a011, 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF. Information and Computation (2000)","DOI":"10.1006\/inco.2000.2917"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"V. Vasconcelos","year":"2000","unstructured":"Vasconcelos, V., Honda, K., Yoshida, N.: Secure information flow as typed process behaviour. In: Smolka, G. (ed.) ESOP 2000 and ETAPS 2000. LNCS, vol.\u00a01782, Springer, Heidelberg (Extended abstract) (2000)"},{"key":"12_CR8","unstructured":"Laurent, O., Honda, K.: An exact correspondence between a typed pi-calculus and polarised proof-nets. draft (2006)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Typed Lambda Calculi and Applications","author":"K. Honda","year":"2001","unstructured":"Honda, K., Yoshida, N., Berger, M.: Sequentiality and the pi-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, Springer, Heidelberg (Extended abstract) (2001)"},{"key":"12_CR10","unstructured":"Honda, K., Yoshida, N., Berger, M.: Strong normalisation in the pi-calculus. Journal of Information and Computation, full version ( 2003)"},{"key":"12_CR11","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Varacca, D., Yoshida, N.: Typed event structures and the pi-calculus. In: MFPS (2006)","DOI":"10.1016\/j.entcs.2006.04.019"},{"key":"12_CR13","unstructured":"Yoshida, N., Honda, K.: Noninterference through flow analysis. Journal of Functional Programming, revised (2005)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73228-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:16:03Z","timestamp":1556680563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73228-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732273","9783540732280"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73228-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}