Skip to main content
SpringerLink
Log in

Theory interpretation in simple type theory

  • Conference paper
  • First Online:
Higher-Order Algebra, Logic, and Term Rewriting (HOA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 816))

Abstract

Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself. This paper presents a method for theory interpretation in a version of simple type theory, called lutins, which admits partial functions and subtypes. The method is patterned on the standard approach to theory interpretation in first-order logic. Although the method is based on a nonclassical version of simple type theory, it is intended as a guide for theory interpretation in classical simple type theories as well as in predicate logics with partial functions.

Supported by the MITRE-Sponsored Research program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth through Proof. Academic Press, 1986.

    Google Scholar 

  2. P. B. Andrews, S. Issar, D. Nesmith, and F. Pfenning. The tps theorem proving system (system abstract). In M. E. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Computer Science, pages 641–642. Springer-Verlag, 1990.

    Google Scholar 

  3. C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1990.

    Google Scholar 

  4. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.

    Google Scholar 

  5. D. Craigen, S. Kromodimoeljo, I. Meisels, A. Neilson, B. Pase, and M. Saaltink. m-eves: A tool for verifying software. In 11th International Conference on Software Engineering (ICSE'11), Singapore, 1988.

    Google Scholar 

  6. D. Craigen, S. Kromodimoeljo, I. Meisels, B. Pase, and M. Saaltink. eves: An overview. Technical Report CP-91-5402-43, ORA Corporation, 1991.

    Google Scholar 

  7. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.

    Google Scholar 

  8. W. M. Farmer. A partial functions version of Church's simple theory of types. Journal of Symbolic Logic, 55:1269–1291, 1990.

    Google Scholar 

  9. W. M. Farmer. A simple type theory with partial functions and subtypes. Annals of Pure and Applied Logic, 64:211–240, 1993.

    Google Scholar 

  10. W. M. Farmer, J. D. Guttman, and F. J. Thayer. Imps: System description. In D. Kapur, editor, Automated Deduction—CADE-11, volume 607 of Lecture Notes in Computer Science, pages 701–705. Springer-Verlag, 1992.

    Google Scholar 

  11. W. M. Farmer, J. D. Guttman, and F. J. Thayer. Little theories. In D. Kapur, editor, Automated Deduction-CADE-11, volume 607 of Lecture Notes in Computer Science, pages 567–581. Springer-Verlag, 1992.

    Google Scholar 

  12. W. M. Farmer, J. D. Guttman, and F. J. Thayer. Imps: an Interactive Mathematical Proof System. Journal of Automated Reasoning, 11:213–248, 1993.

    Google Scholar 

  13. F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 57:323–389, 1992.

    Google Scholar 

  14. J. A. Goguen and T. Winkler. Introducing obj3. Technical Report sri-csl-99-9, sri International, August 1988.

    Google Scholar 

  15. M. J. C. Gordon. hol: A proof generating system for higher-order logic. In G. Birtwistle and P. A. Surahmanyam, editors, VLSI Specification, Verification, and Synthesis, pages 73–128. Kluwer, 1987.

    Google Scholar 

  16. J. D. Guttman. A proposed interface logic for verification environments. Technical Report M91-19, The mitre Corporation, 1991.

    Google Scholar 

  17. R. W. Harper and F. Pfenning. A module system for a programming language based on the LF logical framework. Journal of Functional Programming. Forthcoming.

    Google Scholar 

  18. D. Hilbert. The Foundations of Geometry. Open Court, Chicago, 1902.

    Google Scholar 

  19. K. Kunen. Set Theory: An Introduction to Independence Proofs. North-Holland, 1980.

    Google Scholar 

  20. B. H. Levy. An Approach to Compiler Correctness Using Interpretation Between Theories. PhD thesis, University of California, Los Angeles, 1986. Also Technical Report ATR-86(8454)-4, The Aerospace Corporation, El Segundo, California.

    Google Scholar 

  21. T. S. E. Maibaum, P. A. S. Veloso, and M. R. Sadler. A theory of abstract data types for program development: Bridging the gap? In H. Ehrig, C. Floyd, M. Nivat, and J. Thatcher, editors, Formal Methods and Software Development, Volume 2, volume 186 of Lecture Notes in Computer Science, pages 214–230. Springer-Verlag, 1985.

    Google Scholar 

  22. J. D. Monk. Mathematical Logic. Springer-Verlag, 1976.

    Google Scholar 

  23. J. Mycielski. A lattice of interpretability types of theories. Journal of Symbolic Logic, 42:297–305, 1977.

    Google Scholar 

  24. R. Nakajima and T. Yuasa, editors. The iota Programming System, volume 160 of Lecture Notes in Computer Science. Springer-Verlag, 1982.

    Google Scholar 

  25. T. Nipkow and L. C. Paulson. Isabelle-91. In D. Kapur, editor, Automated Deduction—CADE-11, volume 607 of Lecture Notes in Computer Science, pages 673–676. Springer-Verlag, 1992.

    Google Scholar 

  26. S. Owre, J. M. Rushby, and N. Shankar. pvs: A prototype verification system. In D. Kapur, editor, Automated Deduction-CADE-11, volume 607 of Lecture Notes in Computer Science, pages 748–752. Springer-Verlag, 1992.

    Google Scholar 

  27. J. Rushby, F. von Henke, and S. Owre. An introduction to formal specification and verification using ehdm. Technical Report sri-csl-91-02, sri International, 1991.

    Google Scholar 

  28. J. R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.

    Google Scholar 

  29. D. R. Smith and M. R. Lowry. Algorithmic theories and design tactics. Science of Computer Programming, 14:305–321, 1990.

    Google Scholar 

  30. L. W. Szczerba. Interpretability of elementary theories. In R. E. Butts and J. Hintikka, editors, Logic, Foundations of Mathematics, and Computability Theory, pages 129–145. Reidel, 1977.

    Google Scholar 

  31. L. W. Szczerba. Interpretability and axiomatizability. Bulletin de L'Académie Polonaise des Sciences, 27:425–429, 1979.

    Google Scholar 

  32. A. Tarski, A. Mostowski, and R. M. Robinson. Undecidable theories. North-Holland, 1953.

    Google Scholar 

  33. W. M. Turski and T. S. E. Maibaum. The Specification of Computer Programs. Addison-Wesley, 1987.

    Google Scholar 

  34. J. van Bentham and D. Pearce. A mathematical characterization of interpretation between theories. Logica Studia, 43:295–303, 1984.

    Google Scholar 

  35. P. J. Windley. Formal modeling and verification of microprocessors. IEEE Transactions on Computers. Forthcoming.

    Google Scholar 

  36. P. J. Windley. Abstract theories in hol. In L. Claesen and M. J. C. Gordon, editors, Proceedings of the 1992 International Workshop on the hol Theorem Prover and its Applications. North-Holland, November 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The MITRE Corporation, 202 Burlington Road, 01730-1420, Bedford, MA, USA

    William M. Farmer

Authors
  1. William M. Farmer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Heering Karl Meinke Bernhard Möller Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farmer, W.M. (1994). Theory interpretation in simple type theory. In: Heering, J., Meinke, K., Möller, B., Nipkow, T. (eds) Higher-Order Algebra, Logic, and Term Rewriting. HOA 1993. Lecture Notes in Computer Science, vol 816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58233-9_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-58233-9_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58233-5

  • Online ISBN: 978-3-540-48579-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation