Abstract
A metalogical framework is a logic with an associated methodology that is used to represent other logics and to reason about their metalogical properties. We propose that logical frameworks can be good metalogical frameworks when their logics support reflective reasoning and their theories always have initial models.
We present a concrete realization of this idea in rewriting logic. Theories in rewriting logic always have initial models and this logic supports reflective reasoning. This implies that inductive reasoning is valid when proving properties about the initial models of theories in rewriting logic, and that we can use reflection to reason at the metalevel about these properties. In fact, we can uniformly reflect induction principles for proving metatheorems about rewriting logic theories and their parameterized extensions. We show that this reflective methodology provides an effective framework for different, non-trivial, kinds of formal metatheoretic reasoning; one can, for example, prove metatheorems that relate theories or establish properties of parameterized classes of theories. Finally, we report on the implementation of an inductive theorem prover in the Maude system, whose design is based on the results presented in this paper.
References
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, pages 739–782. North-Holland, Amsterdam, 1977.
D. Basin, M. Clavel, and J. Meseguer. Rewriting logic as a metalogical framework. Technical report, September 2000, http://maude.csl.sri.com.
D. Basin and R. Constable. Metalogical frameworks. In G. Huet and G. Plotkin, editors, Logical Environments, pages 1–29. Cambridge University Press, 1993.
D. Basin and S. Matthews. Scoped metatheorems. In International Workshop on Rewriting Logic and its Applications, volume 15, pages 1–12. Electronic Notes in Theoretical Computer Science (ENTCS), September 1998.
D. Basin and S. Matthews. Structuring metatheory on inductive definitions. Information and Computation, 2000. To appear.
A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236:35–132, 2000.
M. Clavel. Reflection in General Logics and in Rewriting Logic with Applications to the Maude Language. PhD thesis, University of Navarre, 1998.
M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, and J. Meseguer. Metalevel computation in Maude. In C. Kirchner and H. Kirchner, editors, Second International Workshop on Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science, pages 3-23, Pont-á-Mousson, France, September 1998. sevier.
M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: Specification and programming in rewriting logic. SRI International, January 1999, http://maude.csl.sri.com.
M. Clavel, F. Durán, S. Eker, and J. Meseguer. Building equational proving tools by reflection in rewriting logic. In Proceedings of the CafeOBJ Symposium’ 98, Numazu, Japan. CafeOBJ Project, April 1998.
M. Clavel, F. Durán, S. Eker, J. Meseguer, and M.-O. Stehr. Maude as a formal meta-tool. In J. Wing and J. Woodcock, editors, FM’99’ Formal Methods, volume 1709 of Lecture Notes in Computer Science, pages 1684–1703. Springer-Verlag, 1999.
M. Clavel, F. Durán, and N. Martí-Oliet. Polytypic programming in Maude. To appear in Proc. WRLA 2000, ENTCS, Elsevier, 2000.
M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, First International Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, pages 65–89, Asilomar (California), September 1996. Elsevier.
M. Clavel and J. Meseguer. Axiomatizing reflective logics and languages. In G. Kiczales, editor, Proceedings of Reflection’96, pages 263–288, San Francisco (California), April 1996. Xerox PARC.
M. Clavel and J. Meseguer. Reflection and strategies in rewriting logic. In J. Meseguer, editor, First International Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, pages 125–147, Asilomar (California), September 1996. Elsevier.
M. Clavel and J. Meseguer. Reflection in condition rewriting logic. Manuscript.Submitted for publication, 2000.
J. Despeyroux, F. Pfenning, and C. Schürmann. Primitive recursion for higherorder abstract syntax. In Proceedings of the 3rd International Conference on Typed Lambda Calculi and Applications (TLCA’97), volume 1210 ofLecture Notes in Computer Science, Nancy, France, April 1997. Springer-Verlag.
F. Durán. A Reflective Module Algebra with Applications to the Maude Language. PhD thesis, University of Málaga, 1999.
S. Feferman. Finitary inductively presented logics. In Logic Colloquium’ 88. North-Holland, 1988.
J. Goguen and J. Meseguer. Models and equality for logical programming. In H. Ehrig, G. Levi, R. Kowalski, and U. Montanari, editors, Proceedings TAPSOFT’ 87, volume 250 of Lecture Notes in Computer Science, pages 1–22. Springer-Verlag, 1987.
M. Gordon and T. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. J. ACM, 40(1):143–184, January 1993.
N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, August 1993. To appear in D. Gabbay, ed., Handbook of Philosophical Logic, Kluwer Academic Publishers.
N. Martí-Oliet and J. Meseguer. General logics and logical frameworks. In D. Gabbay, editor, What is a Logical System?, pages 355–392. Oxford University Press, 1994.
S. Matthews, A. Smaill, and D. Basin. Experience with FS0 as a framework theory. In G. Huet and G. Plotkin, editors, Logical Environments, pages 61–82. Cambridge University Press, 1993.
R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax. In Twelfth Annual IEEE Symposium on Logic in Computer Science, June 1997.
J. Meseguer. General logics. In H.-D. Ebbinghaus et al., editor, Logic Colloquium’ 87, pages 275–329. North-Holland, 1989.
J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.
J. Meseguer. Membership algebra as a semantic framework for equational specification. In F. Parisi-Presicce, editor, Proceedings of WADT’97, volume 1376 of Lecture Notes in Computer Science, pages 18–61. Springer-Verlag, 1998.
J. Meseguer. Research directions in rewriting logic. In U. Berger and H. Schwichtenberg, editors, Computational Logic, NATO Advanced Study Institute, Marktoberdorf, Germany, July 29-August 6, 1997. Springer-Verlag, 1998.
J. Meseguer and J. A. Goguen. Initiality, induction and computability. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, pages 459–541. Cambridge University Press, 1985.
C. Paulin-Mohring. Inductive Definitions in the System Coq’ Rules and Properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, 1993.
L. C. Paulson. A fixedpoint approach to implementing (co)inductive definitions. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), volume 814 of Lecture Notes in Artificial Intelligence, Nancy, France, June 1994. Springer-Verlag.
L. C. Paulson. Isabelle: a generic theorem prover; with contributions by Tobias Nipkow, volume 828 of Lecture Notes in Computer Science. Springer, Berlin, 1994.
C. Schürmann and F. Pfenning. Automated theorem proving in a simple metalogic for LF. In C. Kirchner and H. Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction (CADE-15), volume 1421 of Lecture Notes in Computer Science, pages 286–300, Lindau, Germany, July 1998. Springer-Verlag.
M.-O. Stehr and J. Meseguer. Pure type systems in rewriting logic. In Proc. of LFM’99: Workshop on Logical Frameworks and Meta-languages, 1999. http://www.cs.bell-labs.com/~felty/LFM99/.
M.-O. Stehr, P. Naumov, and J. Meseguer. A proof-theoretic approach to the HOL-Nuprl connection with applications to proof translation. Manuscript, SRI International, http://www.csl.sri.com/~stehr/fi_eng.html, February 2000.
M. van Emden and R. Kowalski. The semantics of predicate logic as a programming language. J. ACM, 23:733–42, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Basin, D., Clavel, M., Meseguer, J. (2000). Rewriting Logic as a Metalogical Framework. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive