A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
The marriage of bisimulations and Kripke logical relations
2012
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages-that is, languages that combine features like higher-order functions, recursive types, abstract types, and general mutable references. Two of the most prominent types of techniques to have emerged are bisimulations and Kripke logical relations (KLRs). While both approaches are powerful, their complementary advantages have led us and other researchers to
doi:10.1145/2103656.2103666
dblp:conf/popl/HurDNV12
fatcat:xhuicvkxvzbynjoxvsgumjqqrm