LICS
2005
IEEE
14 years 6 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
CSL
2007
Springer
14 years 6 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...