Advertisement

LPF and MPLω — A logical comparison of VDM SL and COLD-K

  • C. A. Middelburg
  • G. R. Renardel de Lavalette
Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 551)

Abstract

This paper compares the finitary three-valued logic LPF and the infinitary two-valued logic MPLω, the logics underlying VDM SL and COLD-K. These logics reflect different approaches to reasoning about partial functions and bringing recursive function definitions into proofs. The purpose of the comparison is to acquire insight into the relationship between these approaches. A natural translation from LPF to MPLω is given. It is shown that what can be proved remains the same after translation, in case strictness axioms are added to LPF or removed from MPLω. The translation from LPF to MPLω is extended to recursive function definitions and this translation is next used to justify some ways of bringing the definitions of partial functions into proofs using LPF.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Avr88]
    A. Avron. Foundations and proof theory of 3-valued logics. LFCS Report ECS-LFCS-88-48, University of Edinburgh, Department of Computer Science, 1988.Google Scholar
  2. [BCJ84]
    H. Barringer, H. Cheng, and C.B. Jones. A logic covering undefinedness in program proofs. Acta Informatica, 21:251–269, 1984.Google Scholar
  3. [Bee85]
    M. J. Beeson. Foundations of Constructive Mathematics. Springer Verlag, 1985.Google Scholar
  4. [Bee88]
    M.J. Beeson. Towards a computation system based on set theory. Theoretical Computer Science, 60:297–340, 1988.Google Scholar
  5. [Ben86]
    E. Bencivenga. Free logics. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, Volume III, chapter III.6. D. Reidel Publishing Company, 1986.Google Scholar
  6. [Bla86]
    S. Blamey. Partial logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, Volume III, chapter III.1. D. Reidel Publishing Company, 1986.Google Scholar
  7. [Che86]
    J.H. Cheng. A Logic for Partial Functions. PhD thesis, University of Manchester, Department of Computer Science, 1986. Technical Report UMCS-86-7-1.Google Scholar
  8. [CJ90]
    J.H. Cheng and C.B. Jones. On the usability of logics which handle partial functions. Technical Report UMCS-90-3-1, University of Manchester, Department of Computer Science, 1990.Google Scholar
  9. [GL90]
    A. Gavilanes-Franco and F. Lucio-Carrasco. A first order logic for partial functions. Theoretical Computer Science, 74:37–69, 1990.Google Scholar
  10. [GMW79]
    M.J.C. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF. Springer Verlag, LNCS 78, 1979.Google Scholar
  11. [Jon86]
    C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall, first edition, 1986.Google Scholar
  12. [Jon89]
    H.B.M. Jonkers. An introduction to COLD-K. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 139–205. Springer Verlag, LNCS 394, 1989.Google Scholar
  13. [Jon90]
    C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall, second edition, 1990.Google Scholar
  14. [JS90]
    C.B. Jones and R.C.F. Shaw. Case Studies in Systematic Software Development. Prentice-Hall, 1990.Google Scholar
  15. [Kar64]
    C. Karp. Languages with Expressions of Infinite Length. North-Holland, 1964.Google Scholar
  16. [Kei71]
    H.J. Keisler. Model Theory for Infinitary Logic. North-Holland, 1971.Google Scholar
  17. [Kle52]
    S.C. Kleene. Introduction to Metamathematics. North-Holland, 1952.Google Scholar
  18. [KR89]
    C.P.J. Koymans and G.R. Renardel de Lavalette. The logic MPLω. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 247–282. Springer Verlag, LNCS 394, 1989.Google Scholar
  19. [KTB88]
    B. Konikowska, A. Tarlecki, and A. Blikle. A three-valued logic for software specification and validation. In R. Bloomfield, L. Marshall, and R. Jones, editors, VDM '88, pages 218–242. Springer Verlag, LNCS 328, 1988.Google Scholar
  20. [Łuk67]
    J. Łukasiewicz. On three-valued logic. In S. McCall, editor, Polish Logic 1920–1939. Oxford University Press, 1967.Google Scholar
  21. [McC67]
    J. McCarthy. A basis for a mathematical theory of computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33–70. North-Holland Publishing Company, 1967.Google Scholar
  22. [Mid90]
    C.A. Middelburg. Syntax and Semantics of VVSL — A Language for Structured VDM Specifications. PhD thesis, University of Amsterdam, September 1990. Available from PTT Research, Dr. Neher Laboratories.Google Scholar
  23. [Owe84]
    O. Owe. An approach to program reasoning based on a first-order logic of partial functions. Computer Science Technical Report CS-081, University of California, San Diego, 1984.Google Scholar
  24. [Pau87]
    L.C. Paulson. Logic and Computation. Cambridge University Press, Cambridge Tracts in Theoretical Computer Science 2, 1987.Google Scholar
  25. [Plo85]
    G.D. Plotkin. Partial function logic. Lectures at Edinburgh University, 1985.Google Scholar
  26. [Ren84]
    G.R. Renardel de Lavalette. Descriptions in mathematical logic. Studia Logica, 43:281–294, 1984.Google Scholar
  27. [Ren89]
    G.R. Renardel de Lavalette. COLD-K2, the static kernel of COLD-K. Report RP/mod-89/8, SERC, 1989.Google Scholar
  28. [Sco67]
    D.S. Scott. Existence and description in formal logic. In R. Schoenman, editor, Bertrand Russell, Philosopher of the Century, pages 181–200. Allen & Unwin, 1967.Google Scholar
  29. [Sco79]
    D.S. Scott. Identity and existence in intuitionistic logic. In M.P. Fourman, C.J. Mulvey, and D.S. Scott, editors, Applications of Sheaves, pages 660–696. Springer Verlag, Lecture Notes in Mathematics 753, 1979.Google Scholar
  30. [Tho89]
    S. Thompson. A logic for Miranda. Formal Aspects of Computing, 1(4):339–365, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • C. A. Middelburg
    • 1
  • G. R. Renardel de Lavalette
    • 2
    • 3
  1. 1.Dept. of Computer SciencePTT Research, Dr. Neher LaboratoriesAK LeidschendamThe Netherlands
  2. 2.Software Engineering Research CentreAK UtrechtThe Netherlands
  3. 3.Section Applied LogicUniversity of UtrechtTC UtrechtThe Netherlands

Personalised recommendations