Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Towards a Mechanisation of a Logic that Copes with Partial Terms

Lookup NU author(s): Emeritus Professor Cliff JonesORCiD, Matthew Lovert, Dr Jason StegglesORCiD

Downloads

Licence

This is the final published version of a report that has been published in its final definitive form by School of Computing Science, University of Newcastle upon Tyne, 2012.

For re-use rights please refer to the publisher's terms and conditions.

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

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2012

Pages: 24

Print publication date: 01/02/2012

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