Towards Ludics Programming: Interactive Proof Search
From MaRDI portal
Publication:5504660
Recommendations
Cites work
- scientific article; zbMATH DE number 1696767 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 1342255 (Why is no real title available?)
- scientific article; zbMATH DE number 1948178 (Why is no real title available?)
- scientific article; zbMATH DE number 1948179 (Why is no real title available?)
- scientific article; zbMATH DE number 2095713 (Why is no real title available?)
- A game semantics for proof search (preliminary results)
- An infinite-game semantics for well-founded negation in logic programming
- First order in Ludics
- Games and full completeness for multiplicative linear logic
- Linear logic
- Locus solum: From the rules of logic to the logic of rules.
- Logic Programming with Focusing Proofs in Linear Logic
- Negation and control in PROLOG
- On full abstraction for PCF: I, II and III
- Quantitative deduction and its fixpoint theory
- Uniform proofs as a foundation for logic programming
Cited in
(7)- Interactive observability in Ludics: the geometry of tests
- Automata, Languages and Programming
- scientific article; zbMATH DE number 1629956 (Why is no real title available?)
- 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)