An environment for automated reasoning about partial functions

  • David A. Basin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


We report on a new environment developed and implemented inside the Nuprl type theory that facilitates proving theorems about partial functions. It is the first such automated type-theoretic account of partiality. We demonstrate that such an environment can be used effectively for proving theorems about computability and for developing partial programs with correctness proofs. This extends the well-known proofs as programs paradigm to partial functions.

Key words and phrases

Automated program development computability constructivity partial functions tactics theorem proving type theory unsolvability 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Robert S. Boyer and J. Strother Moore. A Computational Logic. Academic Press, 1979.Google Scholar
  2. [2]
    Robert S. Boyer and J. Strother Moore. A mechanical proof of the unsolvability of the halting problem. Journal of the Association for Computing Machinery, July 1984.Google Scholar
  3. [3]
    R.L. Constable. Constructive mathematics and automatic program writers. In Proceedings of IFIP Congress, Ljubljana, 1971.Google Scholar
  4. [4]
    R.L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.Google Scholar
  5. [5]
    R.L. Constable and S.F. Smith. Partial objects in constructive type theory. In Symposium on Logic in Computer Science, Computer Society Press of the IEEE, 1987.Google Scholar
  6. [6]
    Thierry Coquand and Gérard Huet. A theory of constructions. 1984. Unpublished manuscript.Google Scholar
  7. [7]
    Douglas J. Howe. Automating Reasoning in an Implementation of Constructive Type Theory. PhD thesis, Cornell, 1987.Google Scholar
  8. [8]
    Per Martin-Löf. Constructive mathematics and computer programming. In Sixth International Congress for Logic, Methodology, and Philosophy of Science, pages 153–175, North Holland, Amsterdam, 1982.Google Scholar
  9. [9]
    Lawrence Paulson. Lessons learned from LCF: a survey of natural deduction proofs. Comp. J., 28(5), 1985.Google Scholar
  10. [10]
    H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.Google Scholar
  11. [11]
    N. Shankar. Towards Mechanical Metamathematics. Technical Report 43, University of Texas at Austin, 1984.Google Scholar
  12. [12]
    S.F. Smith. The Structure Of Computation in Type Theory. PhD thesis, Cornell, 1988. In preparation.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • David A. Basin
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthaca

Personalised recommendations