Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Refinement of higher-order logic programs
Author: Colvin, R.
Hayes, I.
Hemer, D.
Strooper, P.
Citation: Logic based program synthesis and transportation : 12th international workshop, LOPSTR 2002, Madrid, Spain, September 17-20, 2002 : revised selected papers / Michael Leuschel (ed.), pp. 126-143
Publisher: SPRINGER
Publisher Place: Berlin
Issue Date: 2003
Series/Report no.: Lecture notes in computer science; 2664
ISBN: 9783540404385
ISSN: 0302-9743
Conference Name: International Workshop on Logic Program Synthesis and Transformation (2002 : Madrid, Spain)
Statement of
Robert Colvin, Ian Hayes, David Hemer and Paul Strooper
Abstract: A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we extend the refinement calculus for logic programs to include higher-order programming capabilities in specifications and programs, such as procedures as terms and lambda abstraction. We use a higher-order type and term system to describe programs, and provide a semantics for the higher-order language and refinement. The calculus is illustrated by refinement examples.
Description: The original publication is available at
DOI: 10.1007/3-540-45013-0_11
Published version:
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.