TLA is a popular temporal logic for writing stuttering-invariant specifications of digital systems. However, TLA lacks higher-order features useful for specifying modern software written in higher-order programming languages. We use categorical techniques to recast a real-time semantics for TLA in terms of the actions of a group of time dilations, or "stutters," and an extension by a monoid incorporating delays, or "falters." Via the geometric morphism of the associated presheaf topoi induced by the inclusion of stutters into falters, we construct the first model of a higher-order TLA.

中文翻译：

---

动作的高阶时序逻辑的拓扑语义

TLA 是一种流行的时间逻辑，用于编写数字系统的口吃不变规范。然而，TLA 缺乏用于指定用高阶编程语言编写的现代软件的高阶特征。我们使用分类技术根据一组时间膨胀或“口吃”的动作以及包含延迟或“步履蹒跚”的幺半群的扩展来重铸 TLA 的实时语义。通过将口吃包含在步态中引起的相关 presheaf topoi 的几何态射，我们构建了高阶 TLA 的第一个模型。