Toggle Main Menu Toggle Search

ePrints

Towards a Mechanisation of a Logic that Copes with Partial Terms

Lookup NU author(s): Professor Cliff Jones, Matthew Lovert, Dr Jason Steggles

Downloads


Abstract

It has been pointed out by a number of authors that partial terms (i.e. terms that can fail to denote a value) arise frequently in the specification and development of programs. Furthermore, earlier papers describe and argue for the use of a non-classical logic (the "Logic of Partial Functions") to facilitate sound and convenient reasoning about such terms. This paper addresses some of the issues that arise in trying to provide (semi-)decision procedures -such as resolution- for such a logic. Particular care is needed with the use of "proof by refutation". The paper is grounded on a semantic model.


Publication metadata

Author(s): Jones CB, Lovert MJ, Steggles LJ

Publication type: Report

Series Title: School of Computing Science Technical Report Series

Year: 2012

Pages: 24

Source Publication Date: February 2012

Report Number: 1314

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/1314.pdf


Share