Deriving Bisimulations by Simplifying Partitions
Abstract elided by the publisher.
Related papers
- Bisimulation up-to techniques for psi-calculi CPP 2016
- Small bisimulations for reasoning about higher-order imperative programs POPL 2006
- Environmental bisimulations for probabilistic higher-order languages POPL 2016
- Environmental Bisimulations for Probabilistic Higher-order Languages TOPLAS 2019
- Environmental bisimulations for higher-order languages TOPLAS 2011
- Separation Constraint Partitioning - A New Algorithm for Partitioning Non-strict Programs into Sequential Threads POPL 1995
- Queueing and glueing for optimal partitioning (functional pearl) ICFP 2016
- Deriving Target Code as a Representation of Continuation Semantics TOPLAS 1982