Show simple item record

dc.contributor.authorConstable, Robert L.en_US
dc.date.accessioned2007-04-19T19:06:57Z
dc.date.available2007-04-19T19:06:57Z
dc.date.issued1973-10en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-187en_US
dc.identifier.urihttps://hdl.handle.net/1813/6030
dc.description.abstractWe define a class of tree schemata and a notion of refinement between trees (finite or infinite). These concepts allow us to talk about different "ways to program an algorithm" and the "structure" of an algorithm. We obtain as a special case certain concepts such as "approximation", "convergence" and "fixed point semantics" recently employed by Scott to describe the semantics of flow diagrams. We concentrate in this paper on relating our concepts to Scott's.en_US
dc.format.extent1898780 bytes
dc.format.extent739058 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.titleOn the Relation of Refinement Between Algorithmsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics