Universal Domains for Sequential Computation
| dc.contributor.author | Kanneganti, Ramarao | |
| dc.date.accessioned | 2017-08-02T22:03:28Z | |
| dc.date.available | 2017-08-02T22:03:28Z | |
| dc.date.issued | 1995-05 | |
| dc.date.note | May 1995 | |
| dc.description | This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16836 | |
| dc.description.abstract | Classical recursion theory asserts that all conventional programming languages are equally expressive because they can define all partial recursive functions over the natural numbers. However, most real programming languages support some form of higher-order data such as potentially infinite streams, lazy trees, and functions. Since these objects do not have finite canonical representations, computations over these objects cannot be accurately modeled as ordinary computations over the natural numbers. In my thesis, I develop a theory of higher order computability based on a new formulation of domain theory. This new formulation interprets elements of any data domain as lazy trees. Like classical domain theory, it provides a universal domain T and a universal language KL. A rich class of domains called observably sequential domains can be specified in T with functions definable in KL. Such an embedding of a data domain enables the operations on the domain to be defined in the universal language. Unlike embeddings in classical domain theory, embeddings in T retain enough computational information to separate terminating and non-terminating computations. An important practical consequence of this embedding is the fact that the definitions of program operations are effective, implying that denotational language definitions expressed in this framework are effective interpreters. | |
| dc.format.extent | 197 pp | |
| dc.identifier.citation | Kanneganti, Ramarao. "Universal Domains for Sequential Computation." (1995) https://hdl.handle.net/1911/96454. | |
| dc.identifier.digital | TR95-315 | |
| dc.identifier.uri | https://hdl.handle.net/1911/96454 | |
| dc.language.iso | eng | |
| dc.rights | You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s). | |
| dc.title | Universal Domains for Sequential Computation | |
| dc.type | Technical report | |
| dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1