Full abstraction for polymorphic -calculus

DOI10.1016/J.TCS.2007.09.020zbMATH Open1134.68040OpenAlexW1972857373MaRDI QIDQ2474052FDOQ2474052

Authors: Alan Jeffrey, Julian Rathke 

Publication date: 5 March 2008

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

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

Recommendations

• Foundations of Software Science and Computational Structures
• A fully abstract model for the \(\pi\)-calculus.
• Types and full abstraction for polyadic \(\pi\)-calculus
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Genericity and the \(\pi\)-calculus

Mathematics Subject Classification ID

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

Cites Work

• LCF considered as a programming language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A calculus of mobile processes. II
• Contextual equivalence for higher-order \(\pi\)-calculus revisited
• Title not available (Why is that?)
• A Theory of Communicating Sequential Processes
• The \(\pi\)-calculus: A theory of mobile processes
• A calculus of mobile agents
• On reduction-based process semantics
• Resource access control in systems of mobile agents
• Barbed bisimulation
• Title not available (Why is that?)
• A hierarchy of equivalences for asynchronous calculi
• Theories of Programming Languages
• Fully abstract models of typed \(\lambda\)-calculi
• Title not available (Why is that?)
• Behavioral equivalence in the polymorphic pi-calculus
• A new type assignment for λ-terms
• Parametric polymorphism and operational equivalence
• A bisimulation for type abstraction and recursion

Cited In (14)

• Foundations of Software Science and Computational Structures
• Full abstraction, totality and PCF
• An intensionally fully-abstract sheaf model for \(\pi\)
• A fully abstract model for the \(\pi\)-calculus.
• Automata, Languages and Programming
• Full Abstraction for Linda
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Types and full abstraction for polyadic \(\pi\)-calculus
• Title not available (Why is that?)
• Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
• Polymorphic Abstract Syntax via Grothendieck Construction
• Full abstraction and the Context Lemma (preliminary report)
• Full Abstraction and the Context Lemma
• The abstract variable-binding calculus

This page was built for publication: Full abstraction for polymorphic \(\pi \)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474052)