Show simple item record

dc.contributor.advisor Cartwright, Robert S.
dc.creatorKanneganti, Ramarao
dc.date.accessioned 2009-06-04T00:12:03Z
dc.date.available 2009-06-04T00:12:03Z
dc.date.issued 1995
dc.identifier.urihttps://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 190 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectComputer science
dc.title Universal domains for sequential computation
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Computer Science
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Doctoral
thesis.degree.name Doctor of Philosophy
dc.identifier.citation Kanneganti, Ramarao. "Universal domains for sequential computation." (1995) Diss., Rice University. https://hdl.handle.net/1911/16836.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record