Edinburgh Research Archive

Concrete Domains

Simple item page
dc.contributor.author
Kahn, Gilles
en
dc.contributor.author
Plotkin, Gordon
en
dc.date.accessioned
2003-11-05T15:49:24Z
dc.date.available
2003-11-05T15:49:24Z
dc.date.issued
1993
dc.description.abstract
This paper introduces the theory of a particular kind of computation domains called concrete domains. The purpose of this theory is to find a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation.
en
dc.format.extent
541655 bytes
en
dc.format.mimetype
application/pdf
en
dc.identifier.uri
http://hdl.handle.net/1842/203
dc.language.iso
en
dc.subject
Laboratory for Foundations of Computer Science
en
dc.title
Concrete Domains
en
dc.type
Preprint
en

Files

Original bundle

Now showing 1 - 1 of 1
Name:
Concrete.pdf
Size:
528.96 KB
Format:
Adobe Portable Document Format
Download

This item appears in the following Collection(s)

Informatics Publications