A bisimulation for type abstraction and recursion
From MaRDI portal
Publication:3546343
DOI10.1145/1284320.1284325zbMath1326.68073OpenAlexW2085080904MaRDI QIDQ3546343
Eijiro Sumii, Benjamin C. Pierce
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_papers/151
Related Items (15)
The impact of higher-order state and control effects on local relational reasoning ⋮ A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc ⋮ A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation ⋮ A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go ⋮ Semantic preservation for a type directed translation scheme of Featherweight Go ⋮ Non-parametric parametricity ⋮ Refactoring and representation independence for class hierarchies ⋮ First-order reasoning for higher-order concurrency ⋮ Program equivalence in a simple language with state ⋮ From Applicative to Environmental Bisimulation ⋮ Unnamed Item ⋮ Full Abstraction at Package Boundaries of Object-Oriented Languages ⋮ A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: A bisimulation for type abstraction and recursion
