output
20022009
most citedBSDEs with stochastic Lipschitz condition and quadratic PDEs in Hilbert spaces

100 citations

researchers with a paper here
collaborating institutions
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2009

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…

cs.LO2009

Variable binding, symmetric monoidal closed theories, and bigraphs

Richard Garner, Tom Hirschowitz, Aurélien Pardon

This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our…

cs.LO2009★ 4 cited

Contraction-free proofs and finitary games for Linear Logic

André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz

In the standard sequent presentations of Girard's Linear Logic (LL), there are two "non-decreasing" rules, where the premises are not smaller than the conclusion, namely the cut an…

cs.LO2009

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…

cs.LO2008★ 3 cited

Graphical Presentations of Symmetric Monoidal Closed Theories

Richard Garner, Tom Hirschowitz, Aurélien Pardon

We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in te…

cs.LO2008★ 2 cited

Binding bigraphs as symmetric monoidal closed theories

Tom Hirschowitz, Aurélien Pardon

Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and…