DocumentCode :
3300199
Title :
Discrimination by parallel observers
Author :
Dezani-Ciancaglini, Mariangiola ; Tiuryn, Jerzy ; Urzyczyn, Pawel
Author_Institution :
Dipartimento di Inf., Torino Univ., Italy
fYear :
1997
fDate :
29 Jun-2 Jul 1997
Firstpage :
396
Lastpage :
407
Abstract :
The main result of the paper is a proof of the following equivalence: two pure lambda terms are observationally equivalent in the lazy concurrent lambda calculus if they have the same Levy-Longo trees. It follows that contextual equivalence coincides with behavioural equivalence (bisimulation) as considered by Sangiorgi (1994). Another consequence is that the discriminating power of concurrent lambda contexts is the same as that of Boudol-Laneve´s contexts with multiplicities (1996)
Keywords :
lambda calculus; parallel algorithms; programming theory; trees (mathematics); type theory; Levy-Longo trees; behavioural equivalence; bisimulation; concurrent lambda contexts; contextual equivalence; discriminating power; discrimination; lazy concurrent lambda calculus; multiplicities; parallel observers; pure lambda terms; Calculus; Equations; Informatics; Prototypes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1997. LICS '97. Proceedings., 12th Annual IEEE Symposium on
Conference_Location :
Warsaw
ISSN :
1043-6871
Print_ISBN :
0-8186-7925-5
Type :
conf
DOI :
10.1109/LICS.1997.614965
Filename :
614965
Link To Document :
بازگشت