AbstractWe define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual equivalence. This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We present logical bisimulations, a form of bisimulation for higher-order languages, in which the b...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
data by sealing, and develop a bisimulation proof method that is sound and complete with respect to ...
AbstractWe define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
AbstractWe develop a general method for proving properties of programs under arbitrary contexts–incl...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
International audienceWe present a fully abstract encoding of λ ref , the call-by-value λ-calculus w...
Abstract. Developing a theory of bisimulation in higher-order languages can be hard. Particularly ch...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
In this paper we give a representation of a weakest precondition calculus for abstract object creat...
We present a call-by-need λ-calculus λND with an erratic non-deterministic operator pick and a non-r...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We present logical bisimulations, a form of bisimulation for higher-order languages, in which the b...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
data by sealing, and develop a bisimulation proof method that is sound and complete with respect to ...
AbstractWe define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
AbstractWe develop a general method for proving properties of programs under arbitrary contexts–incl...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
International audienceWe present a fully abstract encoding of λ ref , the call-by-value λ-calculus w...
Abstract. Developing a theory of bisimulation in higher-order languages can be hard. Particularly ch...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
In this paper we give a representation of a weakest precondition calculus for abstract object creat...
We present a call-by-need λ-calculus λND with an erratic non-deterministic operator pick and a non-r...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
We present logical bisimulations, a form of bisimulation for higher-order languages, in which the b...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
DOI
Add to ORKG