On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus

DOI10.1016/j.tcs.2004.10.005zbMath1078.68106OpenAlexW2133824354MaRDI QIDQ1763728

Davide Sangiorgi, Daniel Hirschkoff, Arnaud Carayol

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.005

zbMATH Keywords

\(\pi\)-calculusFairnessLambda-calculusBehavioural equivalence

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Extracting total Amb programs from proofs ⋮ A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations ⋮ Observing Success in the Pi-Calculus ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus ⋮ Closures of may-, should- and must-convergences for contextual equivalence ⋮ Observational program calculi and the correctness of translations ⋮ Amb Breaks Well-Pointedness, Ground Amb Doesn't ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures

Cites Work

• Lambda-calculi for (strict) parallel functions
• Asynchronous process calculi: The first- and higher-order paradigms
• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
• Decoding choice encodings
• Proving congruence of bisimulation in functional programming languages
• Interaction Nets with McCarthy's amb
• A Filter Model for Concurrent $\lambda$-Calculus
• Divergence and fair testing
• A Naïve Time Analysis and its Theory of Cost Equivalence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item