English
Related papers

Related papers: Cofree coalgebras and differential linear logic

200 papers

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

Logic in Computer Science · Computer Science 2019-05-14 Lê Thành Dũng Nguyên

In the Boehm theorem workshop on Crete island, Zoran Petric called Statman's ``Typical Ambiguity theorem'' typed Boehm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda…

Logic in Computer Science · Computer Science 2009-09-29 Satoshi Matsuoka

Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of…

Logic in Computer Science · Computer Science 2014-08-04 Frank Roumen

We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…

Discrete Mathematics · Computer Science 2015-05-05 Daniel R. Patten , Howard A. Blair , David W. Jakel , Robert J. Irwin

For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…

Combinatorics · Mathematics 2015-08-11 Christian Jäkel

We present the definition of the logical framework TF, the Type Framework. TF is a lambda-free logical framework; it does not include lambda-abstraction or product kinds. We give formal proofs of several results in the metatheory of TF, and…

Logic in Computer Science · Computer Science 2008-11-18 Robin Adams

This work is a mathematician's attempt to understand intuitionistic logic. It can be read in two ways: as a research paper interspersed with lengthy digressions into rethinking of standard material; or as an elementary (but highly…

Logic · Mathematics 2017-05-02 Sergey A. Melikhov

A simply connected topological space X has homotopy Lie algebra $\pi_*(\Omega X) \tensor \Q$. Following Quillen, there is a connected differential graded free Lie algebra (dgL) called a Lie model, which determines the rational homotopy type…

Algebraic Topology · Mathematics 2007-11-28 Peter Bubenik

We construct $W$-types in the category of coalgebras for a cartesian comonad. It generalizes the constructions of $W$-types in presheaf toposes and gluing toposes.

Category Theory · Mathematics 2019-01-23 Taichi Uemura

The paper relates two variants of semantic models for natural language, logical functional models and compositional distributional vector space models, by transferring the logic and reasoning from the logical to the distributional models.…

Logic in Computer Science · Computer Science 2014-12-31 Anne Preller

A simply colored coalgebra is a coassociative counital coalgebra $C$ over an arbitrary ring $R$, which can be decomposed into a direct sum of two $R$-modules: one generated by set-like elements and another consisting of conilpotent…

Algebraic Topology · Mathematics 2023-09-26 Yang Mo

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

In this paper we introduce the notion of coalgebra symmetry for discrete systems. With this concept we prove that all discrete radially symmetric systems in standard form are quasi-integrable and that all variational discrete quasi-radially…

Exactly Solvable and Integrable Systems · Physics 2023-05-08 G. Gubbiotti , D. Latini , B. K. Tapley

We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate the use of coalgebra as an alternative framework. On the one hand, coalgebras allow the dynamics of repeated measurement to be captured, and…

Quantum Physics · Physics 2009-10-22 Samson Abramsky

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one…

Logic in Computer Science · Computer Science 2016-08-31 Patrick Baillot , Kazushige Terui

We study extensively the homotopy theory of coalgebras. By coalgebras, we mean the full theory of coalgebras: with counits and not necessarily locally conilpotent. For example $\mathcal E_\infty$-coalgebras, $\mathcal A_\infty$-coalgebras,…

Algebraic Topology · Mathematics 2022-03-11 Brice Le Grignou , Damien Lejay

We exhibit a natural Lie algebra structure on the graded space of cyclic coinvariants of a symplectic vector space.

Rings and Algebras · Mathematics 2007-05-23 Eugene Kushnirsky , Michael Larsen

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

Logic · Mathematics 2016-08-17 Eduardo Mizraji

Let C subset Reg be a non-empty class (of regular cardinal). Then the logic L(Q^{cf}_C) has additional nice properties: it has homogeneous model existence property.

Logic · Mathematics 2009-02-04 Saharon Shelah