In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic. In linear logic, proofs can be seen as various kinds of networks as opposed to the flat tree structures of sequent calculus. To distinguish the real proof nets from all the possible networks, Girard devised a criterion involving trips in the network. Trips can in fact be seen as some kind of operator[clarification needed] acting on the proof. Drawing from this observation, Girard[1] described directly this operator from the proof and has given a formula, the so-called execution formula, encoding the process of cut elimination at the level of operators. Subsequent constructions by Girard proposed variants in which proofs are represented as flows,[2] or operators in von Neumann algebras.[3] Those models were later generalised by Seiller's Interaction Graphs models.[4]
One of the first significant applications of GoI was a better analysis[5] of Lamping's algorithm[6] for optimal reduction for the lambda calculus. GoI had a strong influence on game semantics for linear logic and PCF.
Beyond the dynamic interpretation of proofs, geometry of interaction constructions provide models of linear logic, or fragments thereof. This aspect has been extensively studied by Seiller[7] under the name of linear realisability, a version of realizability accounting for linearity.
GoI has been applied to deep compiler optimisation for lambda calculi.[8] A bounded version of GoI dubbed the Geometry of Synthesis has been used to compile higher-order programming languages directly into static circuits.[9]
References
edit- ^ Girard, Jean-Yves (1989). "Geometry of interaction 1: Interpretation of System F". Studies in Logic and the Foundations of Mathematics. 127: 221–260.
- ^ Girard, Jean-Yves (1995). "Geometry of Interaction III: accomodating the additives". London Mathematical Society Lecture Notes Series: 329–389.
- ^ Girard, Jean-Yves (2011). "Geometry of interaction V: logic in the hyperfinite factor". Theoretical Computer Science. 412 (20): 1860–1883.
- ^ Seiller, Thomas (2016). "Interaction graphs: Full linear logic". Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science.
- ^ Gonthier, G.; Abadi, M. N.; Lévy, J. J. (1992). "The geometry of optimal lambda reduction". Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '92. p. 15. doi:10.1145/143165.143172. ISBN 0897914538. S2CID 7265545.
- ^ Lamping, J. (1990). "An algorithm for optimal lambda calculus reduction". Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90. pp. 16–30. doi:10.1145/96709.96711. ISBN 0897913434. S2CID 16333787.
- ^ Seiller, Thomas (2024). Mathematical Informatics (Habilitation thesis). Université Sorbonne Paris Nord.
- ^ Mackie, I. (1995). "The geometry of interaction machine". Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95. pp. 198–208. doi:10.1145/199448.199483. ISBN 0897916921. S2CID 19000897.
- ^ Dan R. Ghica. Function Interface Models for Hardware Compilation. MEMOCODE 2011. [1]
Further reading
edit- GoI tutorial given at Siena 07 by Laurent Regnier, in the Linear Logic workshop, [2]
- Geometry of Interaction at the nLab