One binary horn clause is enough
- Cite this paper as:
- Devienne P., Lebègue P., Routier JC., Würtz J. (1994) One binary horn clause is enough. In: Enjalbert P., Mayr E.W., Wagner K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg
This paper proposes an equivalent form of the famous Böhm-Jacopini theorem for declarative languages. C. Böhm and G. Jacopini  proved that all programming can be done with at most one single whiledo. That result is cited as a mathematical justification for structured programming. A similar result can be shown for declarative programming. Indeed the simplest class of recursive programs in Horn clause languages can be defined by the following scheme:
TopicsLogic in Computer Science Theory of Programming Languages
Unable to display preview. Download preview PDF.