License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2011.512
URN: urn:nbn:de:0030-drops-32535
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3253/
Go to the corresponding LIPIcs Volume Portal

Schwinghammer, Jan ; Birkedal, Lars

Step-Indexed Relational Reasoning for Countable Nondeterminism

pdf-format:
40.pdf (0.5 MB)

Abstract

Programming languages with countable nondeterministic choice are computationally interesting since countable nondeterminism arises when modeling fairness for concurrent systems. Because countable choice introduces non-continuous behaviour, it is well-known that developing semantic models for programming languages with countable nondeterminism is challenging. We present a step-indexed logical relations model of a higher-order functional programming language with countable nondeterminism and demonstrate how it can be used to reason about contextually defined may- and must-equivalence. In earlier step-indexed models, the indices have been drawn from omega. Here the step-indexed relations for must-equivalence are indexed over an ordinal greater than omega.

BibTeX - Entry

@InProceedings{schwinghammer_et_al:LIPIcs:2011:3253,
  author =	{Jan Schwinghammer and Lars Birkedal},
  title =	{{Step-Indexed Relational Reasoning for Countable Nondeterminism}},
  booktitle =	{Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
  pages =	{512--524},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-32-3},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{12},
  editor =	{Marc Bezem},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3253},
  URN =		{urn:nbn:de:0030-drops-32535},
  doi =		{10.4230/LIPIcs.CSL.2011.512},
  annote =	{Keywords: countable choice, lambda calculus, program equivalence}
}

Keywords: countable choice, lambda calculus, program equivalence
Collection: Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
Issue Date: 2011
Date of publication: 31.08.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI