Name
Abstract | ||
|---|---|---|
. This paper proposes an equivalent form of the famous BohmJacopinitheorem for declarative languages. C. Bohm and G. Jacopini [1]proved that all programming can be done with at most one single whiledo.That result is cited as a mathematical justification for structuredprogramming. A similar result can be shown for declarative programming.Indeed the simplest class of recursive programs in Horn clauselanguages can be defined by the following scheme :(A1 / :A2 / A3 : that is 8x1... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-57785-8_128 | STACS |
Keywords | Field | DocType |
binary horn clause,declarative programming | Fifth-generation programming language,Horn clause,Programming language,Computer science,Logic in computer science,Structured programming,Declarative programming,Recursion,Binary number | Conference |
ISBN | Citations | PageRank |
3-540-57785-8 | 3 | 0.40 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Devienne | 1 | 131 | 19.93 |
| Patrick Lebègue | 2 | 33 | 5.13 |
| Jean-christophe Routier | 3 | 61 | 14.20 |
| Jörg Würtz | 4 | 163 | 19.55 |