Parameterizing higher-order processes on names and processes

DOI10.1051/ita/2019005zbMath1434.68334OpenAlexW2999540700MaRDI QIDQ5108373

Xian Xu

Publication date: 4 May 2020

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2019005

zbMATH Keywords

parameterizationencodingfirst-order processhigher-order processcontext bisimulationnormal bisimulation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On quasi-open bisimulation
• On the expressiveness and decidability of higher-order process calculi
• Characterizing contextual equivalence in calculi with passivation
• Bisimulation for higher-order process calculi
• Fair ambients
• Theory of interaction
• On the expressiveness of interaction
• A calculus of mobile processes. II
• Plain CHOCS. A second generation calculus for higher order processes
• Distinguishing and relating higher-order and first-order processes by expressiveness
• Towards `up to context' reasoning about higher-order processes
• A CPS encoding of name-passing in higher-order mobile embedded resources
• On the Relative Expressiveness of Higher-Order Session Processes
• On the Relative Expressive Power of Calculi for Mobility
• Introduction to Bisimulation and Coinduction
• Bisimulations Up-to: Beyond First-Order Transition Systems
• Logical Bisimulations and Functional Languages
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
• Normal Bisimulations in Calculi with Passivation
• On the bisimulation proof method
• On parameterization of higher-order processes
• Bisimulation congruences in safe ambients
• Enhancements of the bisimulation proof method
• Full abstraction for expressiveness: history, myths and facts
• General conditions for full abstraction

This page was built for publication: Parameterizing higher-order processes on names and processes