Towards Ludics Programming: Interactive Proof Search
From MaRDI portal
Publication:5504660
DOI10.1007/978-3-540-89982-2_27zbMATH Open1185.68179OpenAlexW1497327067MaRDI QIDQ5504660FDOQ5504660
Authors: 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
Recommendations
Cut-elimination and normal-form theorems (03F05) Logic programming (68N17) Logic in computer science (03B70)
Cites Work
- On full abstraction for PCF: I, II and III
- Title not available (Why is that?)
- Linear logic
- Locus solum: From the rules of logic to the logic of rules.
- An infinite-game semantics for well-founded negation in logic programming
- Quantitative deduction and its fixpoint theory
- Logic Programming with Focusing Proofs in Linear Logic
- Uniform proofs as a foundation for logic programming
- Title not available (Why is that?)
- A game semantics for proof search (preliminary results)
- Games and full completeness for multiplicative linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Negation and control in PROLOG
- Title not available (Why is that?)
- Title not available (Why is that?)
- First order in Ludics
Cited In (7)
- Interactive observability in Ludics: the geometry of tests
- Automata, Languages and Programming
- Title not available (Why is that?)
- Proof and refutation in MALL as a game
- Locus solum: From the rules of logic to the logic of rules.
- An Interactive Driver for Goal-directed Proof Strategies
- From Foundations to Ludics
This page was built for publication: Towards Ludics Programming: Interactive Proof Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504660)
