125 search results - page 1 / 25 » A bisimulation for type abstraction and recursion |
POPL
2005
ACM
14 years 5 months ago
2005
ACM
traction and Recursion Eijiro Sumii Benjamin C. Pierce University of Pennsylvania
ENTCS
2007
13 years 4 months ago
2007
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
POPL
2012
ACM
12 years 11 days ago
2012
ACM
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 fea...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
CSL
2007
Springer
13 years 11 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...