A Domain-Theoretic Model for a Higher-Order Process Calculus
| dc.contributor.author | Jagadeesan, Radhakrishnan | en_US |
| dc.contributor.author | Panangaden, Prakash | en_US |
| dc.date.accessioned | 2007-04-23T17:39:55Z | |
| dc.date.available | 2007-04-23T17:39:55Z | |
| dc.date.issued | 1989-11 | en_US |
| dc.description.abstract | In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and develop an abstract, model for it. By abstract we mean that the model is constructed domain-theoretically and reflects a certain conceptual viewpoint about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one to model concurrent composition, in the same sense that Plotkin's powerdomain can have a continuous binary operation defined on it to model choice. We show that the model constructed this way is adequate with respect to the operational semantics. The model that we develop and our analysis of it is closely related to the work of Abramsky and Ong on the lazy lambda calculus. | en_US |
| dc.format.extent | 4085497 bytes | |
| dc.format.extent | 1038225 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1058 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6858 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Domain-Theoretic Model for a Higher-Order Process Calculus | en_US |
| dc.type | technical report | en_US |