Location of Repository

Least and Greatest Fixed Points in Ludics

By David Baelde, Amina Doumane and Alexis Saurin


This document corresponds to the long version of a paper accepted for publication at CSL 2015Various 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 designs makes them particularly well suited for representing computations over infinite data. We provide µ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 establish decidability and completeness of semantic inclusion

Topics: infinitary proof systems, circular proofs, proof theory, fixed points, linear logic, ludics, game semantics, com- pleteness, ACM : F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM : F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, [ INFO.INFO-LO ] Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: HAL CCSD
Year: 2015
OAI identifier: oai:HAL:hal-01178396v1
Provided by: Hal-Diderot

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.