Skip to main content
Log in

A typed logic of partial functions reconstructed classically

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

This paper gives a comprehensive description of a typed version of the logic known as LPF. This logic is basic to formal specification and verified design in the software development method VDM. If appropriately extended to deal with recursively defined functions, the data types used in VDM, etc., it gives the VDM notation and its associated rules of reasoning. The paper provides an overview of the needed extensions and examines some of them in detail. It is shown how this nonclassical logic-and the extensions-can be reconstructed classically by embeddings into classical infinitary logic.

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.

Similar content being viewed by others

References

  • [BCJ84] Barringer, H., Cheng, J.H., Jones, C.B.: A logic covering undefinedness in program proofs. Acta Inf.21, 251–269 (1984)

    Google Scholar 

  • [BFL93] Bicarregui, J.C., Fitzgerald, J.S., Lindsay, P.A., Moore, R., Ritchie, B.: Proof in VDM: A practitioner's guide. FACIT. Berlin, Heidelberg, New York: Springer 1993

    Google Scholar 

  • [Che86] Cheng, J.H.: A logic for partial functions. PhD thesis UMCS-86-7-1, University of Manchester, Department of Computer Science, 1986

  • [CJ91] Cheng, J.H., Jones, C.B.: On the usability of logics which handle partial functions. In: Morgan, C., Woodcock, J.C.P. (eds.) 3rd Refinement Workshop, pp. 51–69. Workshops in Computing Series. Berlin, Heidelberg, New York: Springer 1991

    Google Scholar 

  • [FM93] Fitzgerald, J.S., Moore, R.: Experiences in developing a proof theory for VDM specifications. Technical Report TR424, University of Newcastle upon Tyne, Department of Computing Science, 1993. Also in: Andrews, D.J., Groote, J.F., Middelburg, C.A. (eds.) Semantics of specification languages. Workshops in Computing Series. Berlin, Heidelberg, New York: Springer 1994

  • [Jon90] Jones, C.B.: Systematic software development using VDM (2nd edn). Prentice-Hall International Series in Computer Science. Englewood Cliffs, NJ: Prentice-Hall 1990

    Google Scholar 

  • [Kei71] Keisler, H.J.: Model theory for infinitary logic. (Studies in Logic, vol. 62) Amsterdam: North-Holland 1971

    Google Scholar 

  • [KR89] Koymans, C.P.J., Renardel de Lavalette, G.R.: The logic MPLω. In: Wirsing, M., Bergstra, J.A. (eds.) Algebraic methods: theory, tools and applications (Lect. Notes Comput. Sci., vol. 394, pp. 247–282) Berlin, Heidelberg, New York: Springer 1989

    Google Scholar 

  • [KTB88] Konikowska, B., Tarlecki, A., Blikle, A.: A three-valued logic for software specification and validation. In: Bloomfield, R., Marshall, L., Jones, R. (eds.) VDM '88 (Lect. Notes Comput. Sci., vol. 328, pp. 218–242) Berlin, Heidelberg, New York: Springer 1988

    Google Scholar 

  • [Mid93] Middelburg, C.A.: Logic and specification-Extending VDM-SL for advanced formal specification (Computer Science: Research and Practice. vol. 1) London: Chapman & Hall 1993

    Google Scholar 

  • [MR91] Middelburg, C.A., Renardel de Lavalette, G.R.: LPF and MPLω-A logical comparison of VDM-SL and COLD-K. In: Prehn, S., Toetenel, W.J. (eds.) VDM '91, vol. 1 (Lect. Notes Comput. Sci., vol. 551, pp. 279–308) Berlin, Heidelberg, New York: Springer 1991

    Google Scholar 

  • [Pau87] Paulson, L.C.: Logic and computation (Cambridge Tracts in Theoretical Computer Science, vol. 2) Cambridge: Cambridge University Press 1987

    Google Scholar 

  • [Ren89] Renardel de Lavalette, G.R.: COLD-K2 the static kernel of COLD-K. Report RP/mod-89/8, Software Engineering Research Centrum, Utrecht, 1989

    Google Scholar 

  • [Sco67] Scott, D.S.: Existence and description in formal logic. In: Schoenman, R. (ed.) Bertrand Russell, Philosopher of the Century, pp. 181–200. St. Leonards: Allen & Unwin 1967

    Google Scholar 

  • [Sun83] Sundhold, G.: Systems of deduction. In: Gabbay, D., Guenther, F. (eds.) Handbook of philosophical logic, Chap. I.2. Dordrecht: D. Reidel 1983

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jones, C.B., Middelburg, C.A. A typed logic of partial functions reconstructed classically. Acta Informatica 31, 399–430 (1994). https://doi.org/10.1007/BF01178666

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation