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

Direct link
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Uppsala University.
1996 (English)In: INFORMATION PROCESSING LETTERS, ISSN 0020-0190, Vol. 60, no 6, 289-293 p.Article in journal (Other scientific) Published
Abstract [en]

It is well known that for many non-deterministic programming languages there is no continuous fully abstract fixpoint semantics. This is usually attributed to ''problems with continuity'', that is, the assumption that the semantic functions should be cont

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 1996. Vol. 60, no 6, 289-293 p.
Keyword [en]
formal semantics; denotational semantics; fixpoint semantics; fully abstract semantics; non-determinism; infinite computations; concurrency
URN: urn:nbn:se:uu:diva-27209OAI: oai:DiVA.org:uu-27209DiVA: diva2:55103
Addresses: Nystrom SO, UNIV UPPSALA, DEPT COMP SCI, BOX 311, S-75105 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-15

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 160 hits
ReferencesLink to record
Permanent link

Direct link