On correctness of buffer implementations in a concurrent lambda calculus with futures

@inproceedings{Schwinghammer2009OnCO,
  title={On correctness of buffer implementations in a concurrent lambda calculus with futures},
  author={Jan Schwinghammer and David Sabel and Joachim Niehren and Manfred Schmidt-Schau{\ss}},
  year={2009}
}
Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other. Correctness means that our encodings preserve and reflect the observations of may- and must-convergence, and as a consequence also yields soundness of the encodings with respect to a contextually defined notion of program equivalence. While these translations… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.

References

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

A concurrent lambda calculus with futures

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Expressiveness of Process Algebras

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