Towards Ludics Programming: Interactive Proof Search
From MaRDI portal
Recommendations
Cites work
- \(\lambda\mu\)-calculus: an algorithmic interpretation of classical natural deduction
- A game semantics for proof search (preliminary results)
- An infinite-game semantics for well-founded negation in logic programming
- Designs, disputes and strategies
- First order in Ludics
- Games and full completeness for multiplicative linear logic
- scientific article; zbMATH DE number 2095713 (Why is no real title available?)
- 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
- Playing logic programs with the Alpha-Beta algorithm
- Quantitative deduction and its fixpoint theory
- Sequent calculus and the specification of computation
- Travelling on designs. Ludics dynamics
- Uniform proofs as a foundation for logic programming
Cited in
(7)- An architecture for interactive program provers
- Locus solum: From the rules of logic to the logic of rules.
- From Foundations to Ludics
- An Interactive Driver for Goal-directed Proof Strategies
- Interactive observability in Ludics
- Proof and refutation in MALL as a game
- Interactive observability in Ludics: the geometry of tests
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)