There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
1996 (English)In: INFORMATION PROCESSING LETTERS, ISSN 0020-0190, Vol. 60, no 6, 289-293 p.Article in journal (Other scientific) Published
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.
formal semantics; denotational semantics; fixpoint semantics; fully abstract semantics; non-determinism; infinite computations; concurrency
IdentifiersURN: 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.2008-10-172008-10-172011-01-15