AbstractIn this paper we present an algebraic construction of monotonic predicate transformers, using a categorical construction which is similar to the algebraic construction of the integers from the natural numbers. When applied to the category of sets and total functions once, it yields a category isomorphic to the category of sets and relations; a second application yields a category isomorphic to the category of monotonic predicate transformers. This hierarchy cannot be extended further: the category of total functions is not itself an instance of the categorical construction, and can be extended by it only twice
The incremental approach to modular monadic semantics constructs complex monads by using monad trans...
We study relations between predicate transformers and multifunctions in a topological setting based ...
This paper introduces and studies a categorical analogue of the familiar monoid semiring con-structi...
AbstractIn this paper we present an algebraic construction of monotonic predicate transformers, usin...
AbstractThis paper presents a treatment of pre- and post-conditions, and predicate transformers, in ...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
Introduction We propose a complementary approach to discrete dynamical systems, using predicate tra...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
State transformers, which form the objects in a subequalizing category, are a generalization of the ...
State transformers, which form the objects in a subequalizing category, are a generalization of the ...
In this thesis we see two new approaches to compose tree transducers and more general to fuse functi...
In this thesis we see two new approaches to compose tree transducers and more general to fuse functi...
The incremental approach to modular monadic semantics constructs complex monads by using monad trans...
We study relations between predicate transformers and multifunctions in a topological setting based ...
This paper introduces and studies a categorical analogue of the familiar monoid semiring con-structi...
AbstractIn this paper we present an algebraic construction of monotonic predicate transformers, usin...
AbstractThis paper presents a treatment of pre- and post-conditions, and predicate transformers, in ...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
Introduction We propose a complementary approach to discrete dynamical systems, using predicate tra...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
State transformers, which form the objects in a subequalizing category, are a generalization of the ...
State transformers, which form the objects in a subequalizing category, are a generalization of the ...
In this thesis we see two new approaches to compose tree transducers and more general to fuse functi...
In this thesis we see two new approaches to compose tree transducers and more general to fuse functi...
The incremental approach to modular monadic semantics constructs complex monads by using monad trans...
We study relations between predicate transformers and multifunctions in a topological setting based ...
This paper introduces and studies a categorical analogue of the familiar monoid semiring con-structi...