Full abstraction for set-based models of the symmetric interaction combinators

DOI10.1007/978-3-642-28729-9_21MaRDI QIDQ2892780zbMATH OpenOpenAlexFDO

Authors 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 semanticsinteraction netsobservational equivalence

Mathematics Subject Classification ID

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

Recommendations

• Observational equivalence and full abstraction in the symmetric interaction combinators
• A denotational semantics for the symmetric interaction combinators
• Edifices and Full Abstraction for the Symmetric Interaction Combinators
• Interaction combinators
• scientific article; zbMATH DE number 860037

Cited in

(5)

• Interaction combinators
• Observational equivalence and full abstraction in the symmetric interaction combinators
• Edifices and Full Abstraction for the Symmetric Interaction Combinators
• A denotational semantics for the symmetric interaction combinators
• 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)