{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:54:57Z","timestamp":1759146897333},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_33","type":"book-chapter","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T22:03:10Z","timestamp":1226700190000},"page":"467-481","source":"Crossref","is-referenced-by-count":12,"title":["Focusing Strategies in the Sequent Calculus of Synthetic Connectives"],"prefix":"10.1007","author":[{"given":"Kaustuv","family":"Chaudhuri","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1017\/S0960129503003980","volume":"13","author":"S. Abramsky","year":"2003","unstructured":"Abramsky, S.: Sequentiality vs. concurrency in games and logic. Mathematical Structures in Computer Science\u00a013(4), 531\u2013565 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"33_CR2","first-page":"431","volume-title":"14th Symp. on Logic in Computer Science","author":"S. Abramsky","year":"1999","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. In: 14th Symp. on Logic in Computer Science, pp. 431\u2013442. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"3","key":"33_CR3","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. J. of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"J. of Logic and Computation"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75560-9_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Baelde","year":"2007","unstructured":"Baelde, D., Miller, D.: Least and greatest fixed points in linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS, vol.\u00a04790, pp. 92\u2013106. Springer, Heidelberg (2007)"},{"key":"33_CR5","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-0-387-09680-3_26","volume-title":"Fifth IFIP International Conference on Theoretical Computer Science","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Miller, D., Saurin, A.: Canonical sequent proofs via multi-focusing. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) Fifth IFIP International Conference on Theoretical Computer Science. IFIP International Federation for Information Processing, vol.\u00a0273, pp. 383\u2013396. Springer, Boston (2008)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11538363_15","volume-title":"Computer Science Logic","author":"K. Chaudhuri","year":"2005","unstructured":"Chaudhuri, K., Pfenning, F.: Focusing the inverse method for linear logic. In: Luke Ong, C.-H. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 200\u2013215. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10817-007-9091-0","volume":"40","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Pfenning, F., Price, G.: A logical characterization of forward and backward chaining in the inverse method. J. of Automated Reasoning\u00a040(2-3), 133\u2013177 (2008)","journal-title":"J. of Automated Reasoning"},{"key":"33_CR8","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1017\/CBO9780511629150.011","volume-title":"Advances in Linear Logic","author":"V. Danos","year":"1995","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: LKT and LKQ: sequent calculi for second order logic based upon dual linear decompositions of classical implication. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series, vol.\u00a0222, pp. 211\u2013224. Cambridge University Press, Cambridge (1995)"},{"key":"33_CR9","first-page":"498","volume-title":"23th Symp. on Logic in Computer Science","author":"O. Delande","year":"2008","unstructured":"Delande, O., Miller, D.: A neutral approach to proof and refutation in MALL. In: Pfenning, F. (ed.) 23th Symp. on Logic in Computer Science, pp. 498\u2013508. IEEE Computer Society Press, Los Alamitos (2008)"},{"issue":"3","key":"33_CR10","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(3), 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"33_CR11","first-page":"1","volume":"10","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Permutabilities of inferences in Gentzen\u2019s calculi LK and LJ. Memoirs of the American Mathematical Society\u00a010, 1\u201326 (1952)","journal-title":"Memoirs of the American Mathematical Society"},{"key":"33_CR12","unstructured":"Laurent, O.: Etude de la polarisation en logique. Th\u00e8se de doctorat, Universit\u00e9 Aix-Marseille\u00a0II (March 2002)"},{"key":"33_CR13","unstructured":"Laurent, O.: Syntax vs. semantics: a polarized approach. Pr\u00e9publication \u00e9lectronique PPS\/\/03\/04\/\/no 17 (pp), Laboratoire Preuves, Programmes et Syst\u00e8mes (Submitted) (March 2003)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theoretical Computer Science (accepted, 2008)","DOI":"10.1016\/j.tcs.2009.07.041"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-74915-8_31","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Saurin, A.: From proofs to focused proofs: A modular proof of focalization in linear logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 405\u2013419. Springer, Heidelberg (2007)"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Call-by-value is dual to call-by-name. In: 8th Int. Conf. on Functional Programming, pp. 189\u2013201 (2003)","DOI":"10.1145\/944705.944723"},{"key":"33_CR17","first-page":"359","volume-title":"Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008","author":"N. Zeilberger","year":"2008","unstructured":"Zeilberger, N.: Focusing and higher-order abstract syntax. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, pp. 359\u2013369. ACM, New York (2008)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Zeilberger, N.: On the unity of duality. Ann. of Pure and Applied Logic (to appear, 2008)","DOI":"10.1016\/j.apal.2008.01.001"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:12:28Z","timestamp":1557911548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}