James Laird. Bidomains and Full Abstraction for Countable Nondeterminism. In Luca Aceto, Anna Ingólfsdóttir, editors, Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings. Volume 3921 of Lecture Notes in Computer Science, pages 352-366, Springer, 2006. [doi]
@inproceedings{Laird06:0,
title = {Bidomains and Full Abstraction for Countable Nondeterminism},
author = {James Laird},
year = {2006},
doi = {10.1007/11690634_24},
url = {http://dx.doi.org/10.1007/11690634_24},
tags = {abstraction},
researchr = {https://researchr.org/publication/Laird06%3A0},
cites = {0},
citedby = {0},
pages = {352-366},
booktitle = {Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings},
editor = {Luca Aceto and Anna Ingólfsdóttir},
volume = {3921},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-33045-3},
}