Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FTPL
2016

favoriteEmaildiscussreport

45views more FTPL 2016»

Nominal Game Semantics

8 years 23 days ago

Nominal Game Semantics

Download www2.warwick.ac.uk

We employ automata over inﬁnite alphabets to capture the semantics of a ﬁnitary fragment of ML with ground-type references. Our approach is founded on game semantics, which allows us to translate programs into automata in such a way that contextual equivalence is characterized by a ﬁnitary notion of bisimilarity. As a corollary, we derive a decidability result for a class of ﬁrst-order programs, including open ones that contain unspeciﬁed ﬁrst-order procedures.

Andrzej S. Murawski, Nikos Tzevelekos

Real-time Traffic

FTPL 2016 |

claim paper

Related Content

» Full Abstraction for Reduced ML

» Nominal Domain Theory for Concurrency

» Rethinking the Semantics of Complex Nominals

» A knowledgerich approach to identifying semantic relations between nominals

» Classification of Semantic Relationships between Nominals Using Pattern Clusters

» Event Structure Semantics for Nominal Calculi

» Relational Reasoning in a Nominal Semantics for Storage

» Fresh Logic prooftheory and semantics for FM and nominal techniques

» Multi Labelled Transition Systems A Semantic Framework for Nominal Calculi

» Semantic Casts Contracts and Structural Subtyping in a Nominal World

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	FTPL
Authors	Andrzej S. Murawski, Nikos Tzevelekos

Comments (0)