Abstract
In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types. © Springer-Verlag 2004.
Cite
CITATION STYLE
Colvin, R., Groves, L., Hayes, L. J., Hemer, D., Nickson, R., & Strooper, P. (2004). Developing logic programs from specifications using stepwise refinement. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3049, 66–89. https://doi.org/10.1007/978-3-540-25951-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
