Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

DOI10.2168/LMCS-5(4:6)2009zbMATH Open1187.68219OpenAlexW3105059550MaRDI QIDQ3401141

Damiano Mazza

Publication date: 28 January 2010

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-5(4:6)2009

zbMATH Keywords

denotational semanticsfull abstractionBöhm treesobservational equivalenceinteraction nets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (1)

The relational model is injective for multiplicative exponential linear logic (without weakenings)

This page was built for publication: Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

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