The marriage of bisimulations and Kripke logical relations
Open Access
- 25 January 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 47 (1) , 59-72
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Non-parametric parametricityJournal of Functional Programming, 2011
- Concurrent Separation Logic and Operational SemanticsElectronic Notes in Theoretical Computer Science, 2011
- From Applicative to Environmental BisimulationElectronic Notes in Theoretical Computer Science, 2011
- Step-Indexed Kripke Model of Separation Logic for Storable LocksElectronic Notes in Theoretical Computer Science, 2011
- A bisimulation for type abstraction and recursionJournal of the ACM, 2007
- Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types2006
- An indexed model of recursive types for foundational proof-carrying codeACM Transactions on Programming Languages and Systems, 2001
- Behavioral equivalence in the polymorphic pi-calculusJournal of the ACM, 2000
- Relational Properties of DomainsInformation and Computation, 1996
- The Lazy Lambda Calculus in a Concurrency ScenarioInformation and Computation, 1994