Skip to main content
SpringerLink
Log in

MetaPRL – A Modular Logical Environment

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2003)

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

Included in the following conference series:

Abstract

MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive LCF-style tactic-based proof assistant, a logical framework, a logical programming environment, and a formal methods programming toolkit. MetaPRL is distributed under an open-source license and can be downloaded from http://metaprl.org/. This paper provides an overview of the system focusing on the features that did not exist in the previous generations of PRL systems.

This work was supported in part by the DoD Multidisciplinary University Research Initiative (MURI) program administered by the Office of Naval Research (ONR) under Grant N00014-01-1-0765, the Defense Advanced Research Projects Agency (DARPA), the United States Air Force, the Lee Center, and by NSF Grant CCR 0204193.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Cardelli, L.: A Theory of Objects. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  2. Aczel, P.: The type theoretic interpretation of constructive set theory: Inductive definition. In: Logic, Methodology and Philosophy of Science VII, pp. 17–49. Elsevier Science Publishers, Amsterdam (1986)

    Chapter  Google Scholar 

  3. Aczel, P., Rathjen, M.: Notes on constructive set theory. Technical Report 40, Mittag-Leffler (2000/2001)

    Google Scholar 

  4. Allen, S., Bickford, M., Constable, R., et al.: FDL: A prototype formal digital library. PostScript document on website (May 2002), http://www.nuprl.org/html/FDLProject/02cucs-fdl.html

  5. Allen, S., Constable, R., Eaton, R., Kreitz, C., Lorigo, L.: The NuPRL open logical environment. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 170–176. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Aspinall, D.: Proof General – A generic tool for proof development. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, p. 38. Springer, Heidelberg (2000), http://zermelo.dcs.ed.ac.uk/home/da/papers/pgoutline/

    Chapter  Google Scholar 

  7. Aydemir, B., Granicz, A., Hickey, J.: Formal design environments. In: Carreño et al. [16], pp. 12–22

    Google Scholar 

  8. Barras, B., Boutin, S., Cornes, C., Courant, J., Filliâtre, J.-C., Giménez, E., Herbelin, H., Gérard-Mohring, Saïbi, A., Werner, B.: The Coq Proof Assistant Reference Manual. INRIA-Rocquencourt, CNRS and ENS Lyon (1996)

    Google Scholar 

  9. Barzilay, E., Allen, S.: Reflecting higher-order abstract syntax in NuPRL. In: Carreño et al. [16], pp. 23–32

    Google Scholar 

  10. Bates, J.L.: A Logic for Correct Program Development. PhD thesis, Cornell University (1979)

    Google Scholar 

  11. Bates, J.L., Constable, R.L.: Definition of micro-PRL. Technical Report 82–492, Cornell University, Computer Science Department, Ithaca, NY (1981)

    Google Scholar 

  12. Bates, J.L., Constable, R.L.: Proofs as programs. ACM Transactions on Programming Languages and Systems 7(1), 53–71 (1985)

    Article  Google Scholar 

  13. Bibel, W.: Automated Theorem Proving, 2nd edn. Vieweg Verlag, Braunschweig (1987)

    MATH  Google Scholar 

  14. Bickford, M., Kreitz, C., van Renesse, R., Liu, X.: Proving hybrid protocols correct. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 105–120. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.): TPHOLs 2002. LNCS, vol. 2410. Springer, Heidelberg (2002)

    Google Scholar 

  16. Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.): TPHOLs 2002. LNCS, vol. 2410. Springer, Heidelberg (2002); National Aeronautics and Space Administration (2002)

    Google Scholar 

  17. Constable, R.L.: On the theory of programming logics. In: Proceedings of the 9th Annual ACM Symposium on the Theory of Computing, Boulder, CO, May 1977, pp. 269–285 (1977)

    Google Scholar 

  18. Constable, R.L., Allen, S.F., Bromley, H.M., Cleaveland, W.R., Cremer, J.F., Harper, R.W., Howe, D.J., Knoblock, T.B., Mendler, N.P., Panangaden, P., Sasaki, J.T., Smith, S.F.: Implementing Mathematics with the NuPRL Development System. Prentice-Hall, NJ (1986)

    Google Scholar 

  19. Constable, R.L., Hickey, J.: NuPRL’s class theory and its applications. In: Bauer, F.L., Steinbrueggen, R. (eds.) Foundations of Secure Computation. NATO ASI Series, Series F: Computer & System Sciences, pp. 91–116. IOS Press, Amsterdam (2000)

    Google Scholar 

  20. Gordon, M., Milner, R., Wadsworth, C.: Edinburgh LCF. LNCS, vol. 78. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  21. Granicz, A., Hickey, J.: Phobos: A front-end approach to extensible compilers. In: 36th Hawaii International Conference on System Sciences. IEEE, Los Alamitos (2002)

    Google Scholar 

  22. Harrison, J.: HOL Light: A tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265–269. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  23. Hayden, M.: The Ensemble System. PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY (January 1998)

    Google Scholar 

  24. Hickey, J., Nogin, A., Granicz, A., Aydemir, B.: Formal compiler implementation in a logical framework. Submitted to ICFP 2003. Extended version of the paper is available as Caltech Technical Report caltechCSTR:2003.002 (2003)

    Google Scholar 

  25. Hickey, J., Smith, J.D., Aydemir, B., Gray, N., Granicz, A., Tapus, C.: Process migration and transactions using a novel intermediate language. Technical Report caltechCSTR 2002.007, California Institute of Technology, Computer Science (July 2002)

    Google Scholar 

  26. Hickey, J.J.: Formal objects in type theory using very dependent types. In: Foundations of Object Oriented Languages 3 (1996), Available electronically through the http://www.cis.upenn.edu/~bcpierce/FOOL/FOOL3.html

  27. Hickey, J.J.: NuPRL-Light: An implementation framework for higer-order logics. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 395–399. Springer, Heidelberg (1997), An extended version of the paper can be found at http://www.cs.caltech.edu/~jyh/papers/cade14_nl/default.html

    Google Scholar 

  28. Hickey, J.J.: Fault-tolerant distributed theorem proving. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 227–231. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  29. Hickey, J.J.: The MetaPRL Logical Programming Environment. PhD thesis, Cornell University, Ithaca, NY (January 2001)

    Google Scholar 

  30. Hickey, J.J., Aydemir, B., Bryukhov, Y., Kopylov, A., Nogin, A., Yu, X.: A listing of MetaPRL theories, http://metaprl.org/theories.pdf

  31. Hickey, J.J., Nogin, A.: Fast tactic-based theorem proving. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 252–266. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  32. Hickey, J.J., Nogin, A., Kopylov, A., et al.: MetaPRL home page, http://metaprl.org/

  33. Jackson, P.B.: Enhancing the NuPRL Proof Development System and Applying it to Computational Abstract Algebra. PhD thesis, Cornell University, Ithaca, NY (January 1995)

    Google Scholar 

  34. Kopylov, A.: Dependent intersection: A new way of defining records in type theory. In: Proceedings of 18th IEEE Symposium on Logic in Computer Science (2003) (to appear)

    Google Scholar 

  35. Kopylov, A., Nogin, A.: Markov’s principle for propositional type theory. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 570–584. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  36. Kreitz, C., Otten, J.: Connection-based theorem proving in classical and non-classical logics. Journal for Universal Computer Science, Special Issue on Integration of Deductive Systems 5(3), 88–112 (1999)

    MATH  MathSciNet  Google Scholar 

  37. Kreitz, C., Schmitt, S.: A uniform procedure for converting matrix proofs into sequent-style systems. Journal of Information and Computation 162(1-2), 226–254 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  38. Liu, X., Kreitz, C., van Renesse, R., Hickey, J.J., Hayden, M., Birman, K., Constable, R.: Building reliable, high-performance communication systems from components. In: 17th ACM Symposium on Operating Systems Principles (SOSP 1999), December 1999. Operating Systems Review, vol. 34, pp. 80–92 (1999)

    Google Scholar 

  39. Mannion, C.L., Allen, S.F.: A notation for computer aided mathematics. Department of Computer Science TR94-1465, Cornell University, Ithaca, NY (November 1994)

    Google Scholar 

  40. Markov, A.A.: On constructive mathematics. Trudy Matematicheskogo Instituta imeni V.A. Steklova 67, 8–14 (1962); In Russian. English Translation: A.M.S. Translations, series 2, vol.98, pp. 1-9, MR 27#3528

    MATH  Google Scholar 

  41. Martin-Löf, P.: Constructive mathematics and computer programming. In: Proceedings of the Sixth International Congress for Logic, Methodology, and Philosophy of Science, pp. 153–175. North Holland, Amsterdam (1982)

    Chapter  Google Scholar 

  42. Nogin, A.: Quotient types: A modular approach. In: Carreño et al. [15], pp. 263–280, Available at http://nogin.org/papers/quotients.html

  43. Nogin, A.: Theory and Implementation of an Efficient Tactic-Based Logical Framework. PhD thesis, Cornell University, Ithaca, NY (August 2002)

    Google Scholar 

  44. Nogin, A., Hickey, J.: Sequent schema for derived rules. In: Carreño et al. [15], pp. 281–297

    Google Scholar 

  45. Paulson, L., Nipkow, T.: Isabelle tutorial and user’s manual. Technical report, University of Cambridge Computing Laboratory (1990)

    Google Scholar 

  46. Paulson, L.C.: Isabelle. LNCS, vol. 828. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

  47. Pfenning, F.: Logical frameworks. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2. Elsevier Science Publishers, Amsterdam (2001)

    Chapter  Google Scholar 

  48. Schmitt, S., Lorigo, L., Kreitz, C., Nogin, A.: JProver: Integrating connection-based theorem proving into interactive proof assistants. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 421–426. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  49. The Nuprl Staff. PRL: Proof refinement logic programmer’s manual (Lambda PRL, VAX version). Cornell University, Department of Computer Science (1983)

    Google Scholar 

  50. Weis, P., Leroy, X.: Le langage Caml, 2nd edn., Dunod, Paris (1999) (in french)

    Google Scholar 

  51. Yu, X.: Formalizing abstract algebra in constructive set theory. Master’s thesis, California Institute of Technology (2002)

    Google Scholar 

  52. Yu, X., Hickey, J.J.: Formalizing abstract algebra in constructive set theory. Submitted to LICS conference (2003)

    Google Scholar 

  53. Zippel, R.: MathBus, Available online at http://www.cs.cornell.edu/Simlab/papers/mathbus/mathTerm.htm

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, California Institute of Technology M/C 256-80, Pasadena, CA, 91125, USA

    Jason Hickey, Aleksey Nogin, Brian E. Aydemir, Adam Granicz & Xin Yu

  2. Department of Computer Science, Cornell University, Ithaca, NY, 14853, USA

    Robert L. Constable, Eli Barzilay, Richard Eaton, Alexei Kopylov, Christoph Kreitz & Lori Lorigo

  3. Graduate Center, City University of New York, 365 Fifth Avenue, New York, NY, 10016, USA

    Yegor Bryukhov

  4. Laboratory for Logical Problems of Computer Science, Department of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Vorob’evy Gory, 119899, Russia

    Vladimir N. Krupski

  5. Sapient, Presidency Building, Mehrauli-Gurgaon Road, Sector-14, Gurgaon, 112 001, Haryana, India

    Stephan Schmitt

  6. Newton Research Labs, 441 SW 41st Street, Renton, WA, 98055, USA

    Carl Witty

Authors
  1. Jason Hickey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aleksey Nogin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert L. Constable
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Brian E. Aydemir
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Eli Barzilay
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yegor Bryukhov
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Richard Eaton
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Adam Granicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Alexei Kopylov
    View author publications

    You can also search for this author in PubMed Google Scholar

  10. Christoph Kreitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  11. Vladimir N. Krupski
    View author publications

    You can also search for this author in PubMed Google Scholar

  12. Lori Lorigo
    View author publications

    You can also search for this author in PubMed Google Scholar

  13. Stephan Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

  14. Carl Witty
    View author publications

    You can also search for this author in PubMed Google Scholar

  15. Xin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Dep. of Computer Science, ETH Zurich, Switzerland

    David Basin

  2. Computer Science Dept., Saarland University, 66123, Saarbrücken, Germany

    Burkhart Wolff

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hickey, J. et al. (2003). MetaPRL – A Modular Logical Environment. In: Basin, D., Wolff, B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2003. Lecture Notes in Computer Science, vol 2758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10930755_19

Download citation

  • DOI: https://doi.org/10.1007/10930755_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40664-8

  • Online ISBN: 978-3-540-45130-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation