Abstract
This paper presents a general sequent schema language that can be used for specifying sequent-style rules for a logical theory. We show how by adding the sequent schema language to a theory we gain an ability to prove new inference rules within the theory itself. We show that the extension of any such theory with our sequent schema language and with any new rules found using this mechanism is conservative.
By using the sequent schema language in a theorem prover, one gets an ability to allow users to derive new rules and then use such derived rules as if they were primitive axioms. The conservativity result guarantees the validity of this approach. This property makes it a convenient tool for implementing a derived rules mechanism in theorem provers, especially considering that the application of the rules expressed in the sequent schema language can be efficiently implemented using MetaPRL’s fast rewriting engine.
This work was partially supported by ONR grant N00014-01-1-0765 and AFRL grants F49620-00-1-0209 and F30602-98-2-0198.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Robert L. Constable, Stuart F. Allen, H.M. Bromley, W.R. Cleaveland, J.F. Cremer, R.W. Harper, Douglas J. Howe, T.B. Knoblock, N.P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the NuPRL Development System. Prentice-Hall, NJ, 1986.
Michael Gordon and T. Melham. Introduction to HOL: A Theorem Proving Environment for Higher-Oder Logic. Cambridge University Press, Cambridge, 1993.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143–184, January 1993. A revised and expanded verion of’ 87 paper.
Jason J. Hickey. The MetaPRL Logical Programming Environment. PhD thesis, Cornell University, Ithaca, NY, January 2001.
Jason J. Hickey and Aleksey Nogin. Fast tactic-based theorem proving. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 252–266. Springer-Verlag, 2000.
Jason J. Hickey, Aleksey Nogin, Alexei Kopylov, et al. MetaPRL home page. http://metaprl.org/ .
Gérard P. Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31–55, 1978.
Alexei Kopylov. Dependent intersection: A new way of defining records in type theory. Department of Computer Science TR2000-1809, Cornell University, 2000.
Pavel Naumov, Mark-Olivar Stehr, and José Meseguer. The HOL/NuPRL proof translator: A practical approach to formal interoperability. In The 14th International Conference on Theorem Proving in Higher Order Logics, Edinburgh, Scotland, Lecture Notes in Computer Science, pages 329–345. Springer-Verlag, September 2001.
Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828. Springer-Verlag, New York, 1994.
Frank Pfenning. Elf: A language for logic definition and verified metaprogramming. In Proceedings of Fourth Annual Symposium on Logic in Computer Science, pages 313–322, Pacific Grove, California, June 1989. IEEE Computer Society Press.
Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN’88 Conference on Programming Language Design and Implementation (PLDI), pages 199–208, Atlanta, Georgia, June 1988. ACM Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nogin, A., Hickey, J. (2002). Sequent Schema for Derived Rules. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45685-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-45685-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44039-0
Online ISBN: 978-3-540-45685-8
eBook Packages: Springer Book Archive