不动点算子是用于推理递归程序以及通过归纳（例如列表、树）或余归纳（例如流）获得的数据类型的工具。人们借助带不动点的范畴这一概念，对其进行了范畴论处理。Plotkin 和 Simpson 的一个定理刻画了满足双自由代数若干条件的范畴中不动点算子的存在性与唯一性，并恢复了领域理论中的范畴 Cppo（ω-完全带点偏序与连续函数）以及线性逻辑中的关系模型这些标准例子。我们提出该结果的范畴化，并发展 2-范畴不动点算子理论；其中二维框架能够为具有（余）归纳原则的语言建模执行步骤。我们恢复了自函子的初始代数与终余余代数的标准范畴构造，以及广义 species 和多项式函子的不动点。
英文摘要：
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A theorem by Plotkin and Simpson characterizes existence and uniqueness of fixpoint operators for categories satisfying some conditions on bifree algebras and recovers the standard examples of the category Cppo ($ω$-complete pointed partial orders and continuous functions) in domain theory and the relational model in linear logic.
We present a categorification of this result and develop the theory of 2-categorical fixpoint operators where the 2-dimensional framework allows to model the execution steps for languages with (co)inductive principles. We recover the standard categorical constructions of initial algebras and final coalgebras for endofunctors as well as fixpoints of generalized species and polynomial functors.
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we introduce games characterising clopen fixpoints of monotone operators on Stone spaces. These fixpoint games allow us to characterise the semantics for our topological fixpoint logic using a two-player gra…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be constructed by incrementally constructing models for each level. Similar results exist for other non-monotonic formalisms, such as auto-epistemic logic and default logic. In this work, we present a general, algebraicsplitting theory for logics with a fixpoint semantics. Together with the framework of approximation theory, a general fixpoint theory for arbitrary o…
The fixpoint completion fix(P) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix(P). This is well-known and was studied by Dung and Kanchanasut (1989). The correspondence, however, goes much further: The Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix(P), as shown by Wendt (2002), and even carries over to standard operators used for characterizing the well-founded and the Kripke-Kleene semantics. We will apply this knowledge to the study of the stable semantics,…
SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. The recommendation only specifies semantics for non-recursive SHACL; recently, some efforts have been made to allow recursive SHACL schemas. In this paper, we argue that for defining and studying semantics of recursive SHACL, lessons can be learned from years of research in non-monotonic reasoning. We show that from a SHACL schema, a three-valued semantic operator can directly be obtained. Building on Approximation Fixpoint Theory (AFT), this operator immediately induces a wide variety of semantics, including…
Motivated by the recent interest in models of guarded (co-)recursion we study its equational properties. We formulate axioms for guarded fixpoint operators generalizing the axioms of iteration theories of Bloom and Esik. Models of these axioms include both standard (e.g., cpo-based) models of iteration theories and models of guarded recursion such as complete metric spaces or the topos of trees studied by Birkedal et al. We show that the standard result on the satisfaction of all Conway axioms by a unique dagger operation generalizes to the guarded setting. We also introduce the notion of guar…
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 sketching the connection bet…
This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator $Φ^{aggr}_P$ for aggregate programs, independently proposed Pelov et al. This operator allows us to closely tie the computational complexity of the answer set checking and answer sets existence problems to the cost of checking a solution of the aggregates in the program. Finally, we relate th…
The most general type of measurement in quantum physics is modeled by a positive operator-valued measure (POVM). Mathematically, a POVM is a generalization of a measure, whose values are not real numbers, but positive operators on a Hilbert space. POVMs can equivalently be viewed as maps between effect algebras or as maps between algebras for the Giry monad. We will show that this equivalence is an instance of a duality between two categories. In the special case of continuous POVMs, we obtain two equivalent representations in terms of morphisms between von Neumann algebras.
Motivated by the recent interest in models of guarded (co-)recursion, we study their equational properties. We formulate axioms for guarded fixpoint operators generalizing the axioms of iteration theories of Bloom and Ésik. Models of these axioms include both standard (e.g., cpo-based) models of iteration theories and models of guarded recursion such as complete metric spaces or the topos of trees studied by Birkedal et al. We show that the standard result on the satisfaction of all Conway axioms by a unique dagger operation generalizes to the guarded setting. We also introduce the notion of g…
Artificial Intelligence Research Institute (IIIA - CSIC)（西班牙国家研究委员会人工智能研究所）；Nicolaus Copernicus University（尼古拉·哥白尼大学）；CONICET（阿根廷国家科学技术研究委员会）；Univ. Nacional del Centro de la Provincia de Buenos Aires（布宜诺斯艾利斯省国立中部大学）；UBA-FCEyN（布宜诺斯艾利斯大学精确与自然科学学院）；Inst. de Invest. en Cs. de la Computación（计算机科学研究所）
We give a categorical description of the treatment of the !() exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation 'forgets types'. We demonstrate that it may be thought of as a fixed-point operation for reversible logic & computation.
The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By game-theoretic means, we show that this relatively expressive fragment still allows two important techniques of basic modal logic, which notoriously fail for the full modal mu-calculus: filtration and canonical models. In particular, we show that the Filtration Theorem holds for formulas in the language of the continuous modal mu-calculus. As a consequence we obtain the…
Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a corresponding notion of guarded traces, which are defined only if the cycles they induce are guarded. We relate structural guardedness, determined by propagating guardedness along the operations of the category, to geometric guardedness phrased in terms of a diagrammatic language. In our setup, the Cartesian case (recursion) and the co-Cartesian case (iteration) becom…
Functional reactive programming (FRP) makes it possible to express temporal aspects of computations in a declarative way. Recently we developed two kinds of categorical models of FRP: abstract process categories (APCs) and concrete process categories (CPCs). Furthermore we showed that APCs generalize CPCs. In this paper, we extend APCs with additional structure. This structure models recursion and corecursion operators that are related to time. We show that the resulting categorical models generalize those CPCs that impose an additional constraint on time scales. This constraint boils down to …
