Genericity and the \(\pi\)-calculus

DOI10.1007/s00236-005-0175-1zbMath1079.68064OpenAlexW2065261520MaRDI QIDQ2576663

Martin Berger, Nobuko Yoshida, Kohei Honda

Publication date: 14 December 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0175-1

zbMATH Keywords

behavioural equivalencesprocess theorypolymorphic bisimulation

Mathematics Subject Classification ID

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

Related Items

Characteristic bisimulation for higher-order session processes, Trees from Functions as Processes, A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus, Linear logical relations and observational equivalences for session-based concurrency, Full Abstraction in a Subtyped pi-Calculus with Linear Types, Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness, Propositions as sessions

Uses Software

• ML
• Automath
• Pict

Cites Work

• Linear logic
• Strong normalisation in the \(\pi\)-calculus
• Computational interpretations of linear logic
• Imperative objects as mobile processes
• A calculus of mobile processes. II
• Formal parametric polymorphism
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Game-theoretic analysis of call-by-value computation
• Functions as processes
• Parametric polymorphism and operational equivalence
• On model checking data-independent systems with arrays without reset
• A uniform type structure for secure information flow
• CONCUR 2004 - Concurrency Theory
• Behavioral equivalence in the polymorphic pi-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item