Published in: LIPIcs, Volume 12, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (2011)
Jan Schwinghammer and Lars Birkedal. Step-Indexed Relational Reasoning for Countable Nondeterminism. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 512-524, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{schwinghammer_et_al:LIPIcs.CSL.2011.512, author = {Schwinghammer, Jan and Birkedal, Lars}, 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 = {Bezem, Marc}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.512}, URN = {urn:nbn:de:0030-drops-32535}, doi = {10.4230/LIPIcs.CSL.2011.512}, annote = {Keywords: countable choice, lambda calculus, program equivalence} }
Feedback for Dagstuhl Publishing