Skip to Main content Skip to Navigation
   


Full Text Documents

Chargement de la page

Search

Chargement de la page

Table of Contents
Coalgebraic Methods in Computer Science
Marcello M. Bonsangue (Eds.)
Front Matter

Invited Contributions


Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
Davide Sangiorgi
3 - 9
Generic Weakest Precondition Semantics from Monads Enriched with Order
Ichiro Hasuo
10-32
Coalgebraic Multigames
Marina Lenisa
33-49

Regular Contributions


How to Kill Epsilons with a Dagger
Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi
53-74
On Coalgebras with Internal Moves
Tomasz Brengos
75-97
A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics
Sebastian Enqvist, Joshua Sack
98-117
Coalgebraic Simulations and Congruences
H. Gumm, Mehdi Zarrad
118-134
Dijkstra Monads in Monadic Computation
Bart Jacobs
135-150
Categories of Coalgebras with Monadic Homomorphisms
Wolfram Kahl
151-167
Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions
Henning Kerstan, Barbara König, Bram Westerbaan
168-188
Canonical Nondeterministic Automata
Robert Myers, Jiří Adámek, Stefan Milius, Henning Urbat
189-210
Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebra
Baltasar Trancón y Widemann
211-224
Algebraic–Coalgebraic Recursion Theory of History-Dependent Dynamical System Models
Baltasar Trancón y Widemann, Michael Hauhs
225-244

 

 


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