6 papers · 1 filter
Predicate Transformers, (co)Monads and Resolutions
Pierre Hyvernat
This short note contains random thoughts about a factorization theorem for closure/interior operators on a powerset which is reminiscent to the notion of resolution for a monad/com…
Synchronous Games, Simulations and lambda-calculus
Pierre Hyvernat
We refine a model for linear logic based on two well-known ingredients: games and simulations. We have already shown that usual simulation relations form a sound notion of morphism…
Programming interfaces and basic topology
Peter Hancock, Pierre Hyvernat
A pattern of interaction that arises again and again in programming is a "handshake", in which two agents exchange data. The exchange is thought of as provision of a service. Each…
Interaction Systems and Linear Logic, a different games semantics
Pierre Hyvernat
We define a model for linear logic based on two well-known ingredients: games and simulations. This model is interesting in the following respect: while it is obvious that the obje…
Predicate Transformers and Linear Logic, yet another denotational model
Pierre Hyvernat
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a c…
A Completeness Theorem for "Total Boolean Functions"
Pierre Hyvernat
Christine Tasson introduced an algebraic notion of totality for a denotational model of linear logic in the category of vector spaces. The notion of total boolean function is, in a…