Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-25951-0_3 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
calculus,higher order,abstract data type | Abstract data type,Logic program,Programming language,Refinement calculus,Computer science,Proof calculus,Top-down and bottom-up design,Refinement,Software development,Program specification | Conference |
Volume | ISSN | Citations |
3049 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 13 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Colvin | 1 | 68 | 8.67 |
| Lindsay Groves | 2 | 388 | 26.10 |
| Ian J. Hayes | 3 | 634 | 62.03 |
| David Hemer | 4 | 19 | 2.86 |
| Ray Nickson | 5 | 57 | 5.60 |
| Paul Strooper | 6 | 701 | 68.70 |