Discrimination by Parallel Observers: The Algorithm

@article{DezaniCiancaglini1999DiscriminationBP,
  title={Discrimination by Parallel Observers: The Algorithm},
  author={Mariangiola Dezani-Ciancaglini and Jerzy Tiuryn and Pawel Urzyczyn},
  journal={Inf. Comput.},
  year={1999},
  volume={150},
  pages={153-186}
}
The main result of the paper is a constructive proof of the following equivalence: two pure -terms are observationally equivalent in the lazy concurrent -calculus i they have the same L evy-Longo trees. An algorithmwhich allows to build a context discriminating any two pure -terms with di erent L evy-Longo trees is described. It follows that contextual equivalence coincides with behavioural equivalence (bisimulation) as considered by Sangiorgi. Another consequence is that the discriminating… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
9 Extracted Citations
29 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 29 references

The lazy -calculus: an investigation into the foundations of functional programming

  • Ong, C.-H.L
  • Ph.D. Thesis, University of London. (Also Prize…
  • 1988
Highly Influential
12 Excerpts

Set theoretical models of lambda calculus: theory, expansions and isomor- phisms

  • G. Longo
  • Ann. of Pure Appl. Logic
  • 1983
Highly Influential
4 Excerpts

Types for trees, in \Proc. PROCOMET'98", (D.Gries and W.P.de Rover, Eds.), pp.11-29, Chaptman&Hall, London

  • F. Barbanera, M. Dezani-Ciancaglini, F. J. de Vries
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…