General conditions for full abstraction

DOI10.1017/S0960129514000280MaRDI QIDQ5741574zbMATH OpenOpenAlexFDO

Authors Joachim Parrow

Publication date 28 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129514000280

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 194122
• Fully abstract translations between functional languages
• Full abstraction and limiting completeness in equational languages
• scientific article; zbMATH DE number 3976319
• Full abstraction, totality and PCF

Cites work

• On the Asynchronous Nature of the Asynchronous π-Calculus

Cited in

(18)

• Full abstraction and limiting completeness in equational languages
• Coupled similarity: the first 32 years
• Replacement freeness: a criterion for separating process calculi
• Comparing type systems for deadlock freedom
• Comparing process calculi using encodings
• scientific article; zbMATH DE number 4047177 (Why is no real title available?)
• Fully abstract translations between functional languages
• scientific article; zbMATH DE number 1066726 (Why is no real title available?)
• Full Abstraction and the Context Lemma
• Analysing and comparing encodability criteria
• Higher-order processes with parameterization over names and processes
• Parameterizing higher-order processes on names and processes
• Full abstraction for expressiveness: history, myths and facts
• Comparing the expressiveness of the \(\pi \)-calculus and CCS
• On the expressiveness of mixed choice sessions
• Fully Abstract and Robust Compilation
• Mixed choice in session types
• Probabilistic operational correspondence

This page was built for publication: General conditions for full abstraction

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