General conditions for full abstraction

DOI10.1017/S0960129514000280zbMATH Open1361.68085OpenAlexW2327281523MaRDI QIDQ5741574FDOQ5741574

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

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

Mathematics Subject Classification ID

Cites Work

• On the Asynchronous Nature of the Asynchronous π-Calculus

Cited In (17)

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

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)