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...
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...