Results 1 
1 of
1
Discrimination by Parallel Observers: the Algorithm
 LICS '97 , IEEE Comp. Soc
, 1998
"... 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 iff they have the same L'evyLongo trees. An algorithm which allows to build a context discriminating any two pure terms with differe ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
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 iff they have the same L'evyLongo trees. An algorithm which allows to build a context discriminating any two pure terms with different L'evyLongo trees is described. It follows that contextual equivalence coincides with behavioural equivalence (bisimulation) as considered by Sangiorgi. Another consequence is that the discriminating power of concurrent lambda contexts is the same as that of BoudolLaneve's contexts with multiplicities. 3 1 Introduction The aim of this paper is to improve our understanding of what is the "meaning" of a term in the lazy calculus. To explain our result let us begin with the following few observations borrowed from the paper [2] of Abramsky and Ong. In the ordinary calculus, the most natural understanding of evaluation to a "value" is reduction to a normal form. It is however wellk...