Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators

DOI10.1007/978-3-642-28729-9_21zbMATH Open1352.68187OpenAlexW150448265MaRDI QIDQ2892780

Damiano Mazza, Neil J. Ross

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28729-9_21

zbMATH Keywords

denotational semanticsobservational equivalenceinteraction nets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (1)

A formal library of set relations and its application to synchronous languages

This page was built for publication: Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators

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