In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint operator Y as a Conway operator alternatively defined in an inductive or a coinductive way. We then extend the relational semantics with a notion of color or priority in the sense of parity games. This extension enables us to define a new fixpoint operator Y combining both inductive and coinductive policies. We conclude the paper by mentionning a connection between the resulting model of λ-calculus with recursion and higher-order model-checking.
CITATION STYLE
Grellois, C., & Melliès, P. A. (2015). An infinitary model of linear logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9034, pp. 41–55). Springer Verlag. https://doi.org/10.1007/978-3-662-46678-0_3
Mendeley helps you to discover research relevant for your work.