Show simple item record  

dc.contributor.authorHenson, Martin C.
dc.contributor.authorReeves, Steve
dc.date.accessioned2008-10-20T01:05:01Z
dc.date.available2008-10-20T01:05:01Z
dc.date.issued1998-03
dc.identifier.citationHenson, M. C. & Reeves, S. (1998). A logic for the schema calculus. (Working paper 98/5). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1050
dc.description.abstractIn this paper we introduce and investigate a logic for the schema calculus of Z. The schema calculus is arguably the reason for Z’s popularity but so far no true calculus (a sound system of rules for reasoning about schema expressions) has been given. Presentations thus far have either failed to provide a calculus (e.g. the draft standard [3]) or have fallen back on informal descriptions at a syntactic level (most text books e.g. [7]). Once the calculus is established we introduce a derived equational logic which enables us to formalise properly the informal notations of schema expression equality to be found in the literature.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen_US
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.titleA logic for the schema calculusen_US
dc.typeWorking Paperen_US
uow.relation.series98/5


Files in this item

This item appears in the following Collection(s)

Show simple item record