"Bidomains and Full Abstraction for Countable Nondeterminism."

James Laird (2006)

> Home

Details and statistics

DOI: 10.1007/11690634_24

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fossacs/Laird06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/Laird06
James Laird:
Bidomains and Full Abstraction for Countable Nondeterminism. FoSSaCS 2006: 352-366

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.