Towards Ludics Programming: Interactive Proof Search Export

@incollection{citeulike:5368924, abstract = {Girard [1] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic. In this paper, we investigate how ludics could serve as a foundation for logic programming, providing a mechanism for interactive proof search, that is proof search by interaction (or proof search by cut-elimination).}, author = {Saurin, Alexis}, citeulike-article-id = {5368924}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-89982-2_27}, citeulike-linkout-1 = {http://www.springerlink.com/content/425330566m478420}, doi = {10.1007/978-3-540-89982-2_27}, journal = {Logic Programming}, keywords = {logic-programming, logics, ludics}, pages = {253--268}, posted-at = {2009-08-05 07:22:44}, priority = {2}, title = {Towards Ludics Programming: Interactive Proof Search}, url = {http://dx.doi.org/10.1007/978-3-540-89982-2_27}, year = {2008} }

TY - CHAP ID - citeulike:5368924 L3 - citeulike-article-id:5368924 N2 - Girard [1] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic. In this paper, we investigate how ludics could serve as a foundation for logic programming, providing a mechanism for interactive proof search, that is proof search by interaction (or proof search by cut-elimination). JF - Logic Programming EP - 268 TI - Towards Ludics Programming: Interactive Proof Search SP - 253 KW - logic-programming KW - logics KW - ludics AU - Saurin, Alexis PY - 2008/// UR - http://dx.doi.org/10.1007/978-3-540-89982-2_27 ER -