Interaction Graphs: Full Linear Logic

Thomas Seiller (1)

1 PPS - Preuves, Programmes et Systèmes

Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite), provides a model for full linear logic with second order quantification.

Mots clés: Interaction Graphs; Linear Logic; Geometry of Interaction; Quantitative Semantics; Measurable Dynamics

Domaines: Logique [math.LO]

Thomas Seiller. Interaction Graphs: Full Linear Logic. 2015. ⟨hal-01141292⟩