{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:11Z","timestamp":1725522251675},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"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-89982-2_27","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"253-268","source":"Crossref","is-referenced-by-count":3,"title":["Towards Ludics Programming: Interactive Proof Search"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Saurin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Locus solum. Mathematical Structures in Computer Science\u00a011(3) (2001)","DOI":"10.1017\/S096012950100336X"},{"key":"27_CR2","volume-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-type notion of construction, 1969. In: Seldin, Hindley (eds.) To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism. Academic Press, New York (1980)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051 (1991)","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3) (1992)","DOI":"10.1093\/logcom\/2.3.297"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050 (1987)","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Negation and Control in Prolog","author":"L. Naish","year":"1986","unstructured":"Naish, L.: Negation and Control in Prolog. LNCS, vol.\u00a0238. Springer, Heidelberg (1986)"},{"key":"27_CR7","unstructured":"Naish, L.: Pruning in logic programming. Technical Report 95\/16, Department of Computer Science, University of Melbourne, Australia (1995)"},{"key":"27_CR8","series-title":"Nato ASI Series","volume-title":"Computational Logic","author":"D. Miller","year":"1999","unstructured":"Miller, D.: Sequent calculus and the specification of computation. In: Berger, U., Schwichtenberg, H. (eds.) Computational Logic. Nato ASI Series, vol.\u00a0165. Springer, Heidelberg (1999)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Griffin, T.: A formulae-as-types notion of control. In: POPL 1990 (1990)","DOI":"10.1145\/96709.96714"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624. Springer, Heidelberg (1992)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45793-3_30","volume-title":"Computer Science Logic","author":"C. Faggian","year":"2002","unstructured":"Faggian, C., Hyland, M.: Designs, disputes and strategies. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, p. 442. Springer, Heidelberg (2002)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic\u00a059(2) (1994)","DOI":"10.2307\/2275407"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF. Information and Computation\u00a0163 (2000)","DOI":"10.1006\/inco.2000.2917"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"van Emden, M.H.: Quantitative deduction and its fixpoint theory. Journal of Logic Programming\u00a03(1) (1986)","DOI":"10.1016\/0743-1066(86)90003-8"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Cosmo, R.D., Loddo, J.V., Nicolet, S.: A game semantics foundation for logic programming. In: PLILP\/ALP (1998)","DOI":"10.1007\/BFb0056626"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Logic for Programming and Automated Reasoning","author":"J.V. Loddo","year":"2000","unstructured":"Loddo, J.V., Cosmo, R.D.: Playing logic programs with the alpha-beta algorithm. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS, vol.\u00a01955. Springer, Heidelberg (2000)"},{"key":"27_CR17","unstructured":"Loddo, J.V.: G\u00e9n\u00e9ralisation des Jeux Combinatoires et Applications aux Langages Logiques. Ph.D thesis, Universit\u00e9 Paris VII (2002)"},{"key":"27_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198526339.001.0001","volume-title":"Reductive Logic and Proof-search: proof theory, semantics, and control","author":"D. Pym","year":"2004","unstructured":"Pym, D., Ritter, E.: Reductive Logic and Proof-search: proof theory, semantics, and control, vol.\u00a045. Oxford Logic Guides, Oxford (2004)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Pym, D., Ritter, E.: A games semantics for reductive logic and proof-search. In: Ghica, D., McCusker, G. (eds.) GaLoP 2005 (2005)","DOI":"10.1093\/acprof:oso\/9780198526339.001.0001"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Miller, D., Saurin, A.: A game semantics for proof search: Preliminary results. In: Proceedings of MFPS 2005. ENTCS, vol.\u00a0155 (2006)","DOI":"10.1016\/j.entcs.2005.11.072"},{"key":"27_CR21","volume-title":"LICS 2008","author":"O. Delande","year":"2008","unstructured":"Delande, O., Miller, D.: A neutral approach to proof and refutation in MALL. In: Pfenning, F. (ed.) LICS 2008. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Galanaki, C., Rondogiannis, P., Wadge, W.W.: An infinite-game semantics for well-founded negation in logic programming. Annals of Pure and Applied Logic\u00a0151(2) (2008)","DOI":"10.1016\/j.apal.2016.10.005"},{"key":"27_CR23","unstructured":"Laurent, O.: \u00c9tude de la polarisation en logique. Th\u00e8se de doctorat, Universit\u00e9 Aix-Marseille\u00a0II (2002)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Science Logic","author":"C. Faggian","year":"2002","unstructured":"Faggian, C.: Travelling on designs. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471. Springer, Heidelberg (2002)"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Fleury, M.R., Quatrini, M.: First order in ludics. Mathematical Structures in Computer Science\u00a014(2) (2004)","DOI":"10.1017\/S0960129503004134"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T08:06:37Z","timestamp":1557993997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}