{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:08:42Z","timestamp":1767928122719,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642040269","type":"print"},{"value":"9783642040276","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04027-6_30","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T13:27:52Z","timestamp":1252934872000},"page":"409-423","source":"Crossref","is-referenced-by-count":24,"title":["Focalisation and Classical Realisability"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Munch-Maccagnoni","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/357766.351262","volume":"35","author":"P.L. Curien","year":"2000","unstructured":"Curien, P.L., Herbelin, H.: The duality of computation. ACM SIGPLAN Notices\u00a035, 233\u2013243 (2000)","journal-title":"ACM SIGPLAN Notices"},{"key":"30_CR2","unstructured":"Herbelin, H.: Duality of computation and sequent calculus: a few more remarks (manuscript, 2008)"},{"key":"30_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 proof in linear logic. Journal of Logic and Computation\u00a02, 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: A new constructive logic: Classical logic. Math. Struct. Comp. Sci. (1991)","DOI":"10.1017\/S0960129500001328"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/944746.944723","volume":"38","author":"P. Wadler","year":"2003","unstructured":"Wadler, P.: Call-by-value is dual to call-by-name. SIGPLAN Not.\u00a038, 189\u2013201 (2003)","journal-title":"SIGPLAN Not."},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11780342_19","volume-title":"Logical Approaches to Computational Barriers","author":"R. Dyckhoff","year":"2006","unstructured":"Dyckhoff, R., Lengrand, S.: LJQ: A strongly focused calculus for intuitionistic logic. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 173\u2013185. Springer, Heidelberg (2006)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2008.01.007","volume":"153","author":"N. Zeilberger","year":"2008","unstructured":"Zeilberger, N.: On the unity of duality. Ann. Pure and App. Logic\u00a0153, 1 (2008)","journal-title":"Ann. Pure and App. Logic"},{"key":"30_CR8","unstructured":"Krivine, J.L.: Realizability in classical logic. To appear in Panoramas et synth\u00e9ses, Soci\u00e9t\u00e9 Math\u00e9matique de France (2004)"},{"key":"30_CR9","unstructured":"Terui, K.: Computational Ludics. To appear in TCS (2008)"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2307\/2275572","volume":"62","author":"V. Danos","year":"1995","unstructured":"Danos, V., Joinet, J.B., Schellinx, H.: A new deconstructive logic: Linear logic. Journal of Symbolic Logic\u00a062 (3), 755\u2013807 (1995)","journal-title":"Journal of Symbolic Logic"},{"key":"30_CR11","unstructured":"Laurent, O.: Etude de la polarisation en logique. Th\u00e8se de doctorat, Universit\u00e9 Aix-Marseille\u00a0II (2002)"},{"key":"30_CR12","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: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science\u00a011, 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"30_CR13","unstructured":"Munch-Maccagnoni, G.: \u00c9tude polaris\u00e9e du syst\u00e8me L. Master\u2019s thesis (2008)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Curien, P.L., Munch-Maccagnoni, G.: The duality of computation under focus (2009)","DOI":"10.1007\/978-3-642-15240-5_13"},{"key":"30_CR15","first-page":"342","volume-title":"Proc. 6th IEEE Symp. Logic in Computer Science","author":"T. Nipkow","year":"1991","unstructured":"Nipkow, T.: Higher-order critical pairs. In: Proc. 6th IEEE Symp. Logic in Computer Science, pp. 342\u2013349. IEEE Press, Los Alamitos (1991)"},{"key":"30_CR16","unstructured":"Krivine, J.L.: Lambda-calculus, types and models. Ellis Horwood (1993)"},{"issue":"1-3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2008.01.005","volume":"153","author":"S. Lengrand","year":"2008","unstructured":"Lengrand, S., Miquel, A.: Classical F \u03c9 , orthogonality and symmetric candidates. Ann. Pure Appl. Logic\u00a0153(1-3), 3\u201320 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Zeilberger, N.: Refinement types and computational duality. In: PLPV 2009 (2009)","DOI":"10.1145\/1481848.1481852"},{"key":"30_CR19","unstructured":"Girard, J.Y.: Le Point Aveugle, Cours de logique, Tome II: Vers l\u2019imperfection. Visions des Sciences. Hermann (2007)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Beffara, E., Danos, V.: Disjunctive normal forms and local exceptions. In: ACM SIGPLAN Int. Conf. Func, Prog., Uppsala, Sweden, pp. 203\u2013211 (2003)","DOI":"10.1145\/944705.944724"},{"key":"30_CR21","unstructured":"Krivine, J.L.: Structures de r\u00e9alisabilit\u00e9, RAM et ultrafiltre sur N (to appear) (2008)"},{"key":"30_CR22","unstructured":"Herbelin, H.: C\u2019est maintenant qu\u2019on calcule, au c\u0153ur de la dualit\u00e9, Habilitation thesis (2005)"},{"key":"30_CR23","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"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:19:36Z","timestamp":1558523976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}