Distinguishing and relating higher-order and first-order processes by expressiveness

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Acta Informatica

• Publication date

  2012-11-01

• Fields of study

  Mathematics, Philosophy, Computer Science

• Identifiers
  DOI 10.1007/s00236-012-0168-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Process passing calculus, revisited

  2013cited by this paper
• On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi

  2010influential reference
• On the expressiveness of interaction

  2010cited by this paper
• On Bisimulation Theory in Linear Higher-Order pi-Calculus

  2009cited by this paper
• Expressing First-Order π-Calculus in Higher-Order Calculus of Communicating Systems

  2009cited by this paper
• On the Expressiveness and Decidability of Higher-Order Process Calculi

  2008influential reference
• Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA

  2008cited by this paper
• Towards a unified approach to encodability and separation results for process calculi

  2008influential reference
• Branching Bisimilarity with Explicit Divergence

  2008cited by this paper
• From -calculus to Higher-order -calculus | and Back

  2007cited by this paper
• Checking Equivalence for Higher Order Process

  2006cited by this paper
• On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus

  2006cited by this paper
• Up-to Techniques for Weak Bisimulation

  2005cited by this paper
• The Seal Calculus

  2005cited by this paper
• On quasi-open bisimulation

  2005cited by this paper
• A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources

  2005cited by this paper
• Plain CHOCS A second generation calculus for higher order processes

  2005cited by this paper
• A structural approach to operational semantics

  2004cited by this paper
• Bisimulation Congruences for Homer a calculus of Higher-order mobile embedded resources

  2004cited by this paper
• Comparing Recursion, Replication, and Iteration in Process Calculi

  2004cited by this paper
• The Kell Calculus: A Family of Higher-Order Distributed Process Calculi

  2004cited by this paper
• The m-calculus: a higher-order distributed process calculus

  2003cited by this paper
• Replication vs. Recursive Definitions in Channel Based Calculi

  2003cited by this paper
• Comparing the expressive power of the synchronous and asynchronous $pi$-calculi

  2003cited by this paper
• On Barbed Equivalences in pi-Calculus

  2001cited by this paper
• The Pi-Calculus - a theory of mobile processes

  2001cited by this paper
• CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes

  2001cited by this paper
• Comparing the expressive power of the synchronous and the asynchronous π-calculus

  1998cited by this paper
• On the bisimulation proof method

  1998cited by this paper
• Branching time and abstraction in bisimulation semantics

  1996cited by this paper
• Decoding Choice Encodings

  1996cited by this paper
• Branching Bisimilarity is an Equivalence Indeed!

  1996cited by this paper
• pi-Calculus, Internal Mobility, and Agent-Passing Calculi

  1996cited by this paper
• Bisimulation for Higher-Order Process Calculi

  1994cited by this paper
• What is Branching time semantics and why to use it?

  1994cited by this paper
• From pi-Calculus to Higher-Order pi-Calculus - and Back

  1993cited by this paper
• A Theory of Bisimulation for the (cid:25)-calculus (cid:3)

  1993cited by this paper
• Expressing mobility in process algebras : first-order and higher-order paradigms

  1993influential reference
• The Linear Time - Branching Time Spectrum II

  1993cited by this paper
• A Calculus of Mobile Processes, II

  1992cited by this paper
• Barbed Bisimulation

  1992cited by this paper
• The Problem of "Weak Bisimulation up to"

  1992cited by this paper
• Calculi for higher order communicating systems

  1990influential reference
• Functions as processes

  1990cited by this paper
• The linear time - branching time spectrum

  1990cited by this paper
• Communication and concurrency

  1989influential reference
• A calculus of communicating systems with label passing - ten years after

  1986cited by this paper
• The Theory of Interaction

  1901influential reference

• On higher-order communication in ambient calculi

  2025cites this paper
• A thesis for interaction

  2021cites this paper
• On the Interactive Power of Higher-order Processes Extended with Parameterization

  2020cites this paper
• Parameterizing higher-order processes on names and processes

  2019influential citation
• Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

  2018cites this paper
• Bisimulation for Parameterized Higher-order Processes

  2018cites this paper
• On parameterization of higher-order processes

  2017cites this paper
• On the Relative Expressiveness of Higher-Order Session Processes

  2016influential citation
• Higher-order Processes with Parameterization over Names and Processes

  2016cites this paper
• Theory of interaction

  2016cites this paper
• Core Higher-Order Session Processes: Tractable Equivalences and Relative Expressiveness

  2015cites this paper
• On the Computation Power of Name Parameterization in Higher-order Processes

  2015cites this paper
• A logical characterization for linear higher-order processes

  2014cites this paper
• Higher-Order π-Calculus with the Mismatch Operator

  2014cites this paper
• On Context Bisimulation for Parameterized Higher-order Processes

  2013cites this paper
• On the Expressiveness of Parameterization in Process-Passing

  2013cites this paper