uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A fully abstract semantics for concurrent constraint programming
Uppsala University.
Uppsala University.
1998 (English)In: INFORMATION AND COMPUTATION, ISSN 0890-5401, Vol. 146, no 2, 138-180 p.Article in journal (Other scientific) Published
Abstract [en]

A compositional and fully abstract semantics for concurrent constraint programming is developed. It is the first fully abstract semantics which takes into account both non-determinism, infinite computations, and fairness. We present a simple concurrent co

Place, publisher, year, edition, pages
ACADEMIC PRESS INC , 1998. Vol. 146, no 2, 138-180 p.
Keyword [en]
MODEL; COMMUNICATION
Identifiers
URN: urn:nbn:se:uu:diva-27131OAI: oai:DiVA.org:uu-27131DiVA: diva2:55025
Note
Addresses: Nystrom SO, Univ Uppsala, Dept Comp Sci, Box 311, S-75105 Uppsala, Sweden. Univ Uppsala, Dept Comp Sci, S-75105 Uppsala, Sweden. Univ Uppsala, Dept Comp Syst, S-75105 Uppsala, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 380 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf