Skip to main content
Conference Proceedings

Towards ludics programming: Interactive proof search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5366 LNCS 253-268
DOI: 10.1007/978-3-540-89982-2_27
5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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). © 2008 Springer Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Saurin, A. (2008). Towards ludics programming: Interactive proof search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5366 LNCS, pp. 253–268). https://doi.org/10.1007/978-3-540-89982-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free