Full Text Documents

Search


Table of Contents
Coalgebraic Methods in Computer Science
Ichiro Hasuo
Front Matter
Fixed Points of Functors - A Short Abstract
Jiří Adámek
1-4
Compositional Coinduction with Sized Types
Andreas Abel
5-10
Lawvere Categories as Composed PROPs
Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi
11-32
Transitivity and Difunctionality of Bisimulations
Mehdi Zarrad, H. Gumm
33-52
Affine Monads and Side-Effect-Freeness
Bart Jacobs
53-72
Duality of Equations and Coequations via Contravariant Adjunctions
Julian Salamanca, Marcello Bonsangue, Jurriaan Rot
73-93
Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness
Ekaterina Komendantskaya, John Power
94-113
Product Rules and Distributive Laws
Joost Winter
114-135
On the Logic of Generalised Metric Spaces
Octavian Babus, Alexander Kurz
136-155
A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
David Sprunger
156-173
Coalgebraic Completeness-via-Canonicity
Fredrik Dahlqvist
174-194
Relational Lattices via Duality
Luigi Santocanale
195-215
On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
Ievgen Ivanov
216-234

 

 


Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/