Pages that link to "Item:Q1323361"

The following pages link to Plain CHOCS. A second generation calculus for higher order processes (Q1323361):

Displaying 48 items.

• On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
• Characterizing contextual equivalence in calculi with passivation (Q651309) (← links)
• From CML to its process algebra (Q672132) (← links)
• Theory of interaction (Q896903) (← links)
• Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
• Reaction graph (Q1273068) (← links)
• Process calculus based upon evaluation to committed form (Q1276241) (← links)
• Non-interleaving semantics for mobile processes (Q1285660) (← links)
• Bisimulation congruence of \(\chi\)-calculus (Q1398380) (← links)
• On modelling mobility (Q1575151) (← links)
• Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
• Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
• Tile formats for located and mobile systems. (Q1854326) (← links)
• Decoding choice encodings (Q1854385) (← links)
• Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
• Tau laws for pi calculus (Q1884877) (← links)
• A formal semantics for DAI language NUML (Q1894325) (← links)
• Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
• Variations on mobile processes (Q1960530) (← links)
• The name discipline of uniform receptiveness (Q1960533) (← links)
• On the interactive power of higher-order processes extended with parameterization (Q2026374) (← links)
• On the relative expressiveness of higher-order session processes (Q2272988) (← links)
• Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
• Notions of bisimulation and congruence formats for SOS with data (Q2486401) (← links)
• A CPS encoding of name-passing in higher-order mobile embedded resources (Q2491640) (← links)
• The seal calculus (Q2566220) (← links)
• \(\pi\)-calculus with noisy channels (Q2570971) (← links)
• Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
• On the Relative Expressiveness of Higher-Order Session Processes (Q2802492) (← links)
• The Value-Passing Calculus (Q2842635) (← links)
• HOCore in Coq (Q2945640) (← links)
• The λ-calculus in the π-calculus (Q3094164) (← links)
• Howe’s Method for Calculi with Passivation (Q3184692) (← links)
• Normal Bisimulations in Calculi with Passivation (Q3617734) (← links)
• The name discipline of uniform receptiveness (extended abstract) (Q4571962) (← links)
• A proof theoretical approach to communication (Q4571964) (← links)
• Process specification and verification (Q4645279) (← links)
• On parameterization of higher-order processes (Q4976336) (← links)
• (Q5015357) (← links)
• From a concurrent λ-calculus to the π-calculus (Q5055881) (← links)
• Graph-grammar semantics of a higher-order programming language for distributed systems (Q5096275) (← links)
• Reasoning about higher-order processes (Q5096732) (← links)
• Parameterizing higher-order processes on names and processes (Q5108373) (← links)
• Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
• Equivalence Checking for a Finite Higher Order π-Calculus (Q5458809) (← links)
• Higher-order psi-calculi (Q5740353) (← links)
• A fully abstract denotational semantics for the calculus of higher-order communicating systems (Q5940933) (← links)
• Recursive equations in higher-order process calculi (Q5958778) (← links)