dc.date.accessioned | 2008-04-15T15:32:19Z | |
dc.date.accessioned | 2018-11-24T10:30:19Z | |
dc.date.available | 2008-04-15T15:32:19Z | |
dc.date.available | 2018-11-24T10:30:19Z | |
dc.date.issued | 1983-07 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/41197 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/41197 | |
dc.description | This paper has been accepted by the ITT Workshop on Reusability in Programming, Newport RI, September 7-9, 1983. | en |
dc.description.abstract | There has been a long-standing desire in computer science for a way of collecting and using libraries of standard software components. Unfortunately, there has been only limited success in actually doing this. We believe that the lack of success stems not from any resistance to the idea, nor from any lack of trying, but rather from the difficulty of choosing an appropriate formalism for representing components. In this paper we define five desiderata for a good formalization of reusable software components and discuss many of the formalisms which have been used for representing components in light of these desiderata. We then briefly describe a formalism we are developing — the Plan Calculus — which seeks to satisfy these desiderata by combining together the best features of prior formalisms. | en |
dc.language.iso | en_US | en |
dc.publisher | MIT Artificial Intelligence Laboratory | en |
dc.title | Formalizing Reusable Software Components | en |
dc.type | Working Paper | en |