9 search results - page 2 / 2 » Codensity Liftings of Monads |
CONCUR
2006
Springer
13 years 7 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
IANDC
2006
13 years 5 months ago
2006
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
FOSSACS
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...