Eager normal form bisimulation (2005)
| Venue: | In Proc. 20th Annual IEEE Symposium on Logic in Computer Science |
| Citations: | 12 - 4 self |
BibTeX
@INPROCEEDINGS{Lassen05eagernormal,
author = {Soren B. Lassen and Paul Blain Levy},
title = {Eager normal form bisimulation},
booktitle = {In Proc. 20th Annual IEEE Symposium on Logic in Computer Science},
year = {2005},
pages = {345--354},
publisher = {IEEE Computer Society}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize Lévy-Longo tree equivalence and Boehm tree equivalence. It has been adapted to a range of untyped, higher-order calculi, but types have presented a difficulty. In this paper, we present an account of normal form bisimulation for types, including recursive types. We develop our theory for a continuation-passing style calculus, Jump-With-Argument (JWA), where normal form bisimilarity takes a very simple form. We give a novel congruence proof, based on insights from game semantics. A notable feature is the seamless treatment of eta-expansion. We demonstrate the normal form bisimulation proof principle by using it to establish a syntactic minimal invariance result and the uniqueness of the fixed point operator at each type.
