AbstractMcCarthy's amb operator has no known denotational semantics, and its basic operational properties - the context lemma, the compatibility of refinement similarity and convex bisimilarity - have long been open. In this paper, we give a single example program that demonstrates the failure of each of these properties. This shows that there cannot be any well-pointed denotational semantics.However, we show that, if amb is given at ground type only, then all of these operational properties do hold
AbstractA language is constructed that supports arbitrary atomic statements, composition, alternativ...
AbstractThis paper presents co-inductive operational theories of program refinement and equivalence,...
AbstractWe present a simple computational metalanguage with general recursive types and multiple not...
AbstractMcCarthy's amb operator has no known denotational semantics, and its basic operational prope...
AbstractWe study the encoding of λ[], the call-by-name λ-calculus enriched with McCarthy's amb opera...
AbstractWe study the encoding of , the call by name λ-calculus enriched with McCarthy's amb operator...
none3siWe study the encoding of, the call by name λ-calculus enriched with McCarthy's amb operator, ...
Abstract This note strengthens the hoary observation that McCarthy’s amb is not monotone with respec...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractPlotkin ((1977) Theoret. Comput. Sci. 5: 223–256) examines the denotational semantics of PCF...
We study the encoding of λ[], the call by name λ-calculus enriched with McCarthy’s amb operator, int...
AbstractA classical result by Rabin states that if a set of trees and its complement are both Büchi ...
AbstractThis paper presents a functional programming language, based on Moggi’s monadic metalanguage...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
International audienceWe study Abramsky's applicative bisimilarity abstractly , in the context of ca...
AbstractA language is constructed that supports arbitrary atomic statements, composition, alternativ...
AbstractThis paper presents co-inductive operational theories of program refinement and equivalence,...
AbstractWe present a simple computational metalanguage with general recursive types and multiple not...
AbstractMcCarthy's amb operator has no known denotational semantics, and its basic operational prope...
AbstractWe study the encoding of λ[], the call-by-name λ-calculus enriched with McCarthy's amb opera...
AbstractWe study the encoding of , the call by name λ-calculus enriched with McCarthy's amb operator...
none3siWe study the encoding of, the call by name λ-calculus enriched with McCarthy's amb operator, ...
Abstract This note strengthens the hoary observation that McCarthy’s amb is not monotone with respec...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractPlotkin ((1977) Theoret. Comput. Sci. 5: 223–256) examines the denotational semantics of PCF...
We study the encoding of λ[], the call by name λ-calculus enriched with McCarthy’s amb operator, int...
AbstractA classical result by Rabin states that if a set of trees and its complement are both Büchi ...
AbstractThis paper presents a functional programming language, based on Moggi’s monadic metalanguage...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
International audienceWe study Abramsky's applicative bisimilarity abstractly , in the context of ca...
AbstractA language is constructed that supports arbitrary atomic statements, composition, alternativ...
AbstractThis paper presents co-inductive operational theories of program refinement and equivalence,...
AbstractWe present a simple computational metalanguage with general recursive types and multiple not...