Amb Breaks Well-Pointedness, Ground Amb Doesn't

@article{Levy2007AmbBW,
  title={Amb Breaks Well-Pointedness, Ground Amb Doesn't},
  author={Paul Blain Levy},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2007},
  volume={173},
  pages={221-239}
}
McCarthy'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. 

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Proving congruence of bisimulation in functional programming languages

D. J. Howe
  • Inf. and Comp
  • 1996
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Call-by-push-value: Decomposing call-by-value and call-by-name

  • Higher-Order and Symbolic Computation
  • 2006
VIEW 1 EXCERPT

Infinitary Howe's Method

  • Electr. Notes Theor. Comput. Sci.
  • 2006
VIEW 1 EXCERPT

Normal Form Simulation for McCarthy's Amb

  • Electr. Notes Theor. Comput. Sci.
  • 2006
VIEW 1 EXCERPT

Call-By-Push-Value: A Functional/Imperative Synthesis

  • Semantics Structures in Computation
  • 2003
VIEW 1 EXCERPT