Similar Items: Full abstraction for nominal general references
- Constraint solving in non-permutative nominal abstract syntax
- General Bindings and Alpha-Equivalence in Nominal Isabelle
- Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
- Full abstraction for fair testing in CCS (expanded version)
- Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
- Completeness of Nominal PROPs