相关论文: Elgot Algebras

It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…

Graded monads refine traditional monads using effect annotations in order to describe quantitatively the computational effects that a program can generate. They have been successfully applied to a variety of formal systems for reasoning…

Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…

We define the completion of an associative algebra $A$ in a set $M=\{M_1,\dots,M_r\}$ of $r$ right $A$-modules in such a way that if $\mathfrak a\subseteq A$ is an ideal in a commutative ring $A$ the completion $A$ in the (right) module…

This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

Definite descriptions are expressions of the form "the unique $x$ satisfying property $C$," which allow reference to objects through their distinguishing characteristics. They play a crucial role in ontology and query languages, offering an…

We introduce a notion of elliptic differential graded Lie algebra. The class of elliptic algebras contains such examples as the algebra of differential forms with values in endomorphisms of a flat vector bundle over a compact manifold, etc.…

We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…

We provide a foundation for working with homological and homotopical methods in categorical algebra. This involves two mutually complementary components, namely (a) the strategic selection of suitable axiomatic frameworks, some well known…

An algebraic theory, sometimes called an equational theory, is a theory defined by finitary operations and equations, such as the theories of groups and of rings. It is well known that algebraic theories are equivalent to finitary monads on…

Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…

Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We…