Show simple item record

dc.contributor.authorConstable, Robert L.en_US
dc.contributor.authorSmith, Scott Fraseren_US
dc.date.accessioned2007-04-23T17:18:55Z
dc.date.available2007-04-23T17:18:55Z
dc.date.issued1987-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-822en_US
dc.identifier.urihttps://hdl.handle.net/1813/6662
dc.description.abstractConstructive type theories generally treat only total functions; partial functions present serious difficulties. In this paper, a theory of partial objects is given which puts partial functions in a general context. Semantic foundations for the theory are given in terms of a theory of inductive relations. The domain of convergence of a partial function is exactly characterized by a predicate within the theory, allowing for abstract reasoning about termination. Induction principles are given for reasoning about these functions, and comparisons are made to the domain theoretic account of LCF. Finally, an undecidability result is presented to suggest connections to a subset of recursive function theory.en_US
dc.format.extent1526661 bytes
dc.format.extent360688 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePartial Objects in Constructive Type Theoryen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics