Towards Ludics Programming: Interactive Proof Search

DOI10.1007/978-3-540-89982-2_27zbMath1185.68179OpenAlexW1497327067MaRDI QIDQ5504660

Alexis Saurin

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_27

zbMATH Keywords

interactionlogic programmingproof searchgame semanticsludicsproof normalization

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Logic programming (68N17)

Related Items

Proof and refutation in MALL as a game

Cites Work

• Linear logic
• Negation and control in PROLOG
• On full abstraction for PCF: I, II and III
• An infinite-game semantics for well-founded negation in logic programming
• Uniform proofs as a foundation for logic programming
• Locus Solum: From the rules of logic to the logic of rules
• Quantitative deduction and its fixpoint theory
• Logic Programming with Focusing Proofs in Linear Logic
• Games and full completeness for multiplicative linear logic
• First order in Ludics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item