A Semantic Analysis of Logics that Cope with Partial Terms
- Lookup NU author(s)
- Professor Cliff Jones
- Matthew Lovert
- Dr Jason Steggles
|
|
|
|
| Author(s) | | Jones CB, Lovert MJ, Steggles LJ |
| Publication type | | Report |
| Series Title | | School of Computing Science Technical Report Series |
| Year | | 2012 |
| Date | | January 2012 |
| Report Number | | 1310 |
| Pages | | 17 |
|
|
|
| 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. |
|
|
|
| Institution | | School of Computing Science, University of Newcastle upon Tyne |
| Place Published | | Newcastle upon Tyne |
| Actions | |  |
