Contextual equivalence for higher-order \(\pi\)-calculus revisited

DOI10.1016/S1571-0661(03)50008-1zbMath1337.68185OpenAlexW2171350732MaRDI QIDQ276479

Julian Rathke, Alan Jeffrey

Publication date: 3 May 2016

Full work available at URL: https://doi.org/10.1016/s1571-0661(03)50008-1

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

A Logic for Distributed Higher Order π-Calculus ⋮ Full abstraction for polymorphic \(\pi \)-calculus ⋮ Equivalence Checking for a Finite Higher Order π-Calculus ⋮ Modelling dynamic web data ⋮ Bisimulation and Co-induction: Some Problems ⋮ Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness

This page was built for publication: Contextual equivalence for higher-order \(\pi\)-calculus revisited