A Semantic Analysis of Logics that Cope with Partial Terms

  1. Lookup NU author(s)
  2. Professor Cliff Jones
  3. Matthew Lovert
  4. Dr Jason Steggles
Author(s)Jones CB, Lovert MJ, Steggles LJ
Publication type Report
Series TitleSchool of Computing Science Technical Report Series
Year2012
Legacy DateJanuary 2012
Report Number1310
Pages17
Full text is available for this publication:
Specifications of programs frequently involve operators and functions that are not defined over all of their (syntactic) domains. Proofs about specifications -and those to discharge proof obligations that arise in justifying steps of design- must be based on formal rules. Since classical logic deals only with defined values, some extra thought is required. There are several ways of handling terms that can fail to denote a value – this paper provides a semantically based comparison of three of the best known approaches. In addition, some pointers are given to further alternatives.
InstitutionSchool of Computing Science, University of Newcastle upon Tyne
Place PublishedNewcastle upon Tyne
URLhttp://www.cs.ncl.ac.uk/publications/trs/papers/1310.pdf
ActionsLink to this publication