Show simple item record

dc.contributor.authorGlew, Nealen_US
dc.date.accessioned2007-04-09T19:57:08Z
dc.date.available2007-04-09T19:57:08Z
dc.date.issued2002-01-25en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2002-1859en_US
dc.identifier.urihttps://hdl.handle.net/1813/5844
dc.description.abstractThis report describes a theory of second-order trees, that is, finite and infinite trees where nodes of the tree can bind variables that appear further down in the tree. Such trees can be used to provide a natural and intuitive interpretation for type systems with equirecursive types and binding constructs like universal and existential quantifiers. The report defines the set of binding trees, and a subset of these called regular binding trees. These are similar to the usual notion of regular trees, but generalized to take into account the binding structure. Then the report shows how to interpret a second-order type system with recursive quantifiers as binding trees, and gives a sound and complete axiomatisation of when two types map to the same tree. Finally the report gives a finite representation for trees called tree automata, and gives a construction for deciding when two automata map to the same tree. To tie everything together, the report defines a mapping from types to automata, thus giving a decision procedure for when two types map to the same tree.en_US
dc.format.extent854210 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Theory of Second-Order Treesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics