{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:26Z","timestamp":1725491606688},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752905"},{"type":"electronic","value":"9783540752929"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75292-9_15","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T10:43:07Z","timestamp":1189507387000},"page":"216-230","source":"Crossref","is-referenced-by-count":0,"title":["A Logical Calculus for Modelling Interferences"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Fouquer\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","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"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.M. Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"issue":"1-2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2005.05.012","volume":"343","author":"O. Laurent","year":"2005","unstructured":"Laurent, O.: Syntax vs. semantics: a polarized approach. Theoretical Computer Science\u00a0343(1-2), 177\u2013206 (2005)","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","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":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","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, pp. 167\u2013183. Springer, Heidelberg (2005)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11874683_21","volume-title":"Computer Science Logic","author":"P.D. Giamberardino","year":"2006","unstructured":"Giamberardino, P.D., Faggian, C.: Jump from parallel to sequential proofs: Multiplicatives. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 319\u2013333. Springer, Heidelberg (2006)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-60983-0_5","volume-title":"Extensions of Logic Programming","author":"I. Cervesato","year":"1996","unstructured":"Cervesato, I., Hodas, J.S., Pfenning, F.: Efficient resource management for linear logic proof search. In: Herre, H., Dyckhoff, R., Schroeder-Heister, P. (eds.) ELP 1996. LNCS, vol.\u00a01050, pp. 67\u201381. Springer, Heidelberg (1996)"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P.W. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bulletin of Symbolic Logic\u00a05(2), 215\u2013244 (1999)","journal-title":"Bulletin of Symbolic Logic"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Transactions on Computational Logic\u00a08(1) (2007)","DOI":"10.1145\/1182613.1182614"},{"key":"15_CR10","unstructured":"Fouquer\u00e9, C.: A Sequent Calculus for Modelling Interferences. Technical report, LIPN, Universit\u00e9 Paris 13 (2007), \n                  \n                    http:\/\/hal.archives-ouvertes.fr\/hal-00156386\/en\/"},{"issue":"1-2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75292-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:01:43Z","timestamp":1558490503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75292-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752905","9783540752929"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75292-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}