Algebraic structures which are generated by a collection of constructors| like natural
numbers (generated by a zero and a successor) or nite lists and trees| are of well …

Publisher Summary From the early 1930s, there evolved two kinds of mathematical
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …

In the semantics of programming, finite data types such as finite lists, have traditionally been
modelled by initial algebras. Later final coalgebras were used in order to deal with infinite …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

An object invariant defines what it means for an object's data to be in a consistent state.
Object invariants are central to the design and correctness of objectoriented programs. This …

Publisher Summary This chapter outlines the development of the algebraic semantics of
modal logic and introduces an alternative coalgebraic approach. Algebraic semantics is …

This paper publicly reveals, motivates, and surveys the results of an ambitious hidden
agenda for applying algebra to software engineering. The paper reviews selected literature …

The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic
transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel …

During the past few years there has been an dramatic upsurge in research and
development, implementations of new technologies, and deployments of actual solutions …

Page 1 Logics for Coalgebras and Applications to Computer Science Alexander Kurz Page 2
Logics for Coalgebras and Applications to Computer Science Dissertation zur Erlangung des …