3 results
Jiri Adamek ; Stefan Milius ; Jiri Velebil.
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in which the terminals are interpreted as continuous operations. […]
Published on April 1, 2011
Jiri Adamek ; Stefan Milius ; Jiri Velebil.
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories instead, i.e., theories in which abstract recursive […]
Published on November 8, 2006
Thorsten Wißmann ; Ulrich Dorsch ; Stefan Milius ; Lutz Schröder.
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical relational systems but also, e.g. various forms of weighted systems […]
Published on January 31, 2020