Least and Greatest Fixed Points in Ludics.

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 µ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 µ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 makes them particularly well suited for representing computations over infinite data. We provide µMALL with a denotational semantics, interpreting proofs by and formulas by particular sets of called behaviours. Then we prove a completeness result for the class of essentially finite designs , which are those performing a finite computation followed by a copycat. On the way to completeness, we establish decidability and completeness of semantic inclusion.