Least and Greatest Fixed Points in Ludics

Authors David Baelde, Amina Doumane, Alexis Saurin

Thumbnail PDF


  • Filesize: 0.64 MB
  • 18 pages

Document Identifiers

Author Details

David Baelde
Amina Doumane
Alexis Saurin

Cite AsGet BibTex

David Baelde, Amina Doumane, and Alexis Saurin. Least and Greatest Fixed Points in Ludics. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 549-566, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Various logics have been introduced in order to reason over (co)inductive specifications and, through the Curry-Howard correspondence, to study computation over inductive and coinductive data. The logic mu-MALL is one of those logics, extending multiplicative and additive linear logic with least and greatest fixed point operators. In this paper, we investigate the semantics of mu-MALL proofs in (computational) ludics. This framework is built around the notion of design, which can be seen as an analogue of the strategies of game semantics. The infinitary nature of designs makes them particularly well suited for representing computations over infinite data. We provide mu-MALL with a denotational semantics, interpreting proofs by designs and formulas by particular sets of designs called behaviours. Then we prove a completeness result for the class of "essentially finite designs", which are those designs performing a finite computation followed by a copycat. On the way to completeness, we investigate semantic inclusion, proving its decidability (given two formulas, we can decide whether the semantics of one is included in the other's) and completeness (if semantic inclusion holds, the corresponding implication is provable in mu-MALL).
  • proof theory
  • fixed points
  • linear logic
  • ludics
  • game semantics
  • completeness
  • circular proofs
  • infinitary proof systems


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads