Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5849
Full metadata record
DC FieldValueLanguage
dc.creatorHewitt, Carl E.-
dc.date2004-10-01T20:49:32Z-
dc.date2004-10-01T20:49:32Z-
dc.date1970-08-01-
dc.date.accessioned2013-10-09T02:41:33Z-
dc.date.available2013-10-09T02:41:33Z-
dc.date.issued2013-10-09-
dc.identifierAIM-207-
dc.identifierhttp://hdl.handle.net/1721.1/5849-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionSchemas are programs in which some of the function symbols are un-interpreted. In this paper we compare classed of schemas in which various kinds of constraints are imposed on some of the function symbols. Among the classes of schemas compared are program, recursive, hierarchical and parallel.-
dc.format56 p.-
dc.format20557460 bytes-
dc.format1190721 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAIM-207-
dc.titleMore Comparative Schematology-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.