Skip to main content
Log in

Predicative methodology

  • Published:
Acta Informatica Aims and scope Submit manuscript

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 article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Constable, R.L., Bates, J.L.: The Nearly Ultimate PEARL. Cornell TR-83-551, 1983

  2. Gupta, L.E.: Predicative Programs and Paradigms. M.Sc. Thesis. University of Toronto 1985

  3. Hehner, E.C.R.: The Logic of Programming. London: Prentice-Hall 1984

    Google Scholar 

  4. Hehner, E.C.R.: Predicative Programming. CACM 27, 134–151 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288466

Keywords

Navigation