In this paper, we develop new variations of methods from operational semantics, and show how to apply these to a linear type theory which has a lazy operational semantics. In particular, we consider how one can establish contextual equivalences in a linear theory with function types and tensor types by instead establishing bisimulations. Thus bisimilarity is sound for contextual equivalence. Further, we show that bisimilarity is complete for contextual equivalence
International audienceIn the ubiquitous presence of linear resources in quantum computation, program...
AbstractWe give a method for proving congruence of bisimulation-like equivalences in functional prog...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...
In recent years there has been much progress in the use of operationally based methods for reasonin...
AbstractMorris-style contextual equivalence – invariance of termination under any context of ground ...
AbstractWe study the problem of characterizing contextual equivalence in higher-order languages with...
Bisimilarity (also known as `applicative bisimulation') has attracted a good deal of attention ...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
Abstract. Developing a theory of bisimulation in higher-order languages can be hard. Particularly ch...
Program equivalence in linear contexts, where programs are used or executed exactly once, is an impo...
AbstractOn the basis of an operational bisimulation account of Böhm tree equivalence, a novel operat...
We apply powerful proof-techniques of concurrency theory to study the ob-servational theory of Thiel...
International audienceWe propose a categorical framework for structural operational semantics, in wh...
We present logical bisimulations, a form of bisimulation for higher-order languages, in which the b...
In the ubiquitous presence of linear resources in quantum computation, program equivalence in linear...
International audienceIn the ubiquitous presence of linear resources in quantum computation, program...
AbstractWe give a method for proving congruence of bisimulation-like equivalences in functional prog...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...
In recent years there has been much progress in the use of operationally based methods for reasonin...
AbstractMorris-style contextual equivalence – invariance of termination under any context of ground ...
AbstractWe study the problem of characterizing contextual equivalence in higher-order languages with...
Bisimilarity (also known as `applicative bisimulation') has attracted a good deal of attention ...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
Abstract. Developing a theory of bisimulation in higher-order languages can be hard. Particularly ch...
Program equivalence in linear contexts, where programs are used or executed exactly once, is an impo...
AbstractOn the basis of an operational bisimulation account of Böhm tree equivalence, a novel operat...
We apply powerful proof-techniques of concurrency theory to study the ob-servational theory of Thiel...
International audienceWe propose a categorical framework for structural operational semantics, in wh...
We present logical bisimulations, a form of bisimulation for higher-order languages, in which the b...
In the ubiquitous presence of linear resources in quantum computation, program equivalence in linear...
International audienceIn the ubiquitous presence of linear resources in quantum computation, program...
AbstractWe give a method for proving congruence of bisimulation-like equivalences in functional prog...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...