一句话：本文将交互几何扩展到指数连接词，使用 graphings 为带二阶量化的初等线性逻辑 ELL 构造 GoI 模型。
本文是交互几何（Geometry of Interaction, GoI）系列工作的第四篇，目标是在 Girard 的 GoI 纲领下系统发展一种组合式方法，为线性逻辑构造能刻画切消动态的可实现性模型。前作已建立交互图框架，本文处理其中最困难的部分：指数连接词（! 与 ?）的语义定义。作者采用此前引入的 graphings——图的一种推广——作为核心结构，说明如何为带二阶量化的初等线性逻辑（Elementary Linear Logic, ELL）定义 GoI 模型。ELL 是线性逻辑的子系统，可刻画初等时间可计算函数类。因此，该工作将 GoI/交互图方法推进到可表达指数与二阶量化的逻辑片段，并为指数连接词提供组合式语义。
This paper is the fourth of a series exposing a systematic combinatorial approach to Girard's Geometry of Interaction (GoI) program. The GoI program aims at obtaining particular realisability models for linear logic that accounts for the dynamics of cut-elimination. This fourth paper tackles the complex issue of defining exponential connectives in this framework. For that purpose, we use the notion of \emph{graphings}, a generalisation of graphs which was defined in earlier work. We explain how to define a GoI for Elementary Linear Logic (ELL) with second-order quantification, a sub-system of linear logic that captures the class of elementary time computable functions.