Summary
We introduce a predicative semantics of programs and show its use in programming. With it, logic errors can be detected and reported when they are made, just like syntax errors. Programming paradigms are stated precisely as theorems. The use of paradigms in larger programs is shown to be the same as the mathematician's use of theorems in the proof of larger theorems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Constable, R.L., Bates, J.L.: The Nearly Ultimate PEARL. Cornell TR-83-551, 1983
Gupta, L.E.: Predicative Programs and Paradigms. M.Sc. Thesis. University of Toronto 1985
Hehner, E.C.R.: The Logic of Programming. London: Prentice-Hall 1984
Hehner, E.C.R.: Predicative Programming. CACM 27, 134–151 (1984)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hehner, E.C.R., Gupta, L.E. & Malton, A.J. Predicative methodology. Acta Informatica 23, 487–505 (1986). https://doi.org/10.1007/BF00288466
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288466