Browse by author
Lookup NU author(s): Professor Cliff Jones,
Dr Jason Steggles
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Partial terms are those that can fail to denote a value; such terms arise frequently in the specification and development of programs. Earlier papers describe and argue for the use of the non-classical “Logic of Partial Functions” (LPF) to facilitate sound and convenient reasoning about such terms. This paper reviews the fundamental theorem proving algorithms –such as resolution– and identifies where they need revision to cope with LPF. Particular care is needed with“refutation” procedures. The modified algorithms are justified with respect to a semantic model. Indications are provided of further work which could lead to efficient support for LPF.
Author(s): Jones CB, Lovert MJ, Steggles LJ
Publication type: Article
Publication status: Published
Journal: Science of Computer Programming
Print publication date: 12/11/2014
Online publication date: 02/10/2013
Acceptance date: 18/09/2013
ISSN (print): 0167-6423
ISSN (electronic): 1872-7964
Publisher: Elsevier BV
Altmetrics provided by Altmetric