Towards Ludics Programming:Interactive Proof Search

摘要

Girard [1] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic.rnIn 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).