All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 26 of 26

Showing per page

Solving Algebraic Equations Using Coalgebra

Federico De Marchi, Neil Ghani, Christoph Lüth (2010)

RAIRO - Theoretical Informatics and Applications

Algebraic systems of equations define functions using recursion where parameter passing is permitted. This generalizes the notion of a rational system of equations where parameter passing is prohibited. It has been known for some time that algebraic systems in Greibach Normal Form have unique solutions. This paper presents a categorical approach to algebraic systems of equations which generalizes the traditional approach in two ways i) we define algebraic equations for locally finitely presentable ...

Strong functors and interleaving fixpoints in game semantics

Pierre Clairambault (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes and equip it with reduction rules allowing a sound translation of Gödel’s system T. We introduce the notion of a μ-closed category, relying on a uniform interpretation of open μLJ formulas as strong functors. We show that any μ-closed category is a sound model for μLJ. We then turn to the construction of a concrete μ-closed category based on Hyland-Ong game semantics. The model relies on three main ingredients:...

μ -bicomplete categories and parity games

Luigi Santocanale (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by μ -terms. We call the category μ -bicomplete if every μ -term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...

μ-Bicomplete Categories and Parity Games

Luigi Santocanale (2010)

RAIRO - Theoretical Informatics and Applications

For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by μ-terms. We call the category μ-bicomplete if every μ-term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...

Currently displaying 21 – 26 of 26

Previous Page 2