Proving congruence of bisimulation in functional programming languages

Proving congruence of bisimulation in functional programming languages (1996)

by Douglas J. Howe

Venue:	Information and Computation
Citations:	102 - 1 self

Datum	Value	Source
TITLE	Proving congruence of bisimulation in functional programming languages	INFERENCE
AUTHOR NAME	Douglas J. Howe	SVM HeaderParse 0.2
AUTHOR AFFIL	ATHT Bell Laboratories	SVM HeaderParse 0.2
AUTHOR ADDR	600 Mountain Avenue, Room 2B-438, Murray Hill, New Jersey 07974	SVM HeaderParse 0.2
ABSTRACT	E-mail: howe research.att.com We give a method for proving congruence of bisimulation-like equivalences in functional programming languages. The method applies to languages that can be presented as a set of expressions together with an evaluation relation. We use this method to show that some generalizations of Abramsky's applicative bisimulation are congruences whenever evaluation can be specified by a certain natural form of structured operational semantics. One of the generalizations handles nondeterminism and diverging computations.] 1996 Academic Press, Inc. 1.	SVM HeaderParse 0.2
YEAR	1996	INFERENCE
VENUE	Information and Computation	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	103--112	INFERENCE
CITATIONS	16 found	ParsCit 1.0