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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.L. Constable, J.L. Bates: The Nearly Ultimate PEARL. Cornell TR-83–551, 1983
L.E. Gupta, Predicative Programs and Paradigms. M.Sc. Thesis, University of Toronto, 1985
E.C.R. Hehner: The Logic of Programming. Prentice-Hall Int., London, 1984
E.C.R. Hehner: Predicative Programming. CACM 27, 2, pp. 134–151, February 1984
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hehner, E.C.R., Gupta, L.E., Malton, A.J. (1987). Predicative Methodology. In: Broy, M. (eds) Logic of Programming and Calculi of Discrete Design. NATO ASI Series, vol 36. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87374-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-87374-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87376-8
Online ISBN: 978-3-642-87374-4
eBook Packages: Springer Book Archive