The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Models and equality for logical programming
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Meta-programming in logic programming
Meta-programming in logic programming
Meta-programming in logic programming
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A framework for defining logics
Journal of the ACM (JACM)
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Reflecting the semantics of reflected proof
Proof theory
The Go¨del programming language
The Go¨del programming language
Papers presented at the second annual Workshop on Logical environments
Experience with FS100 as a framework theory
Papers presented at the second annual Workshop on Logical environments
General logics and logical frameworks
What is a logical system?
Meta-logics and logic programming
Meta-logics and logic programming
Metamathematics, machines, and Go¨del's proof
Metamathematics, machines, and Go¨del's proof
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Structuring metatheory on inductive definitions
Information and Computation
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
The Art of the Metaobject Protocol
The Art of the Metaobject Protocol
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Metalogical Frameworks II: Developing a Reflected Decision Procedure
Journal of Automated Reasoning
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Proceedings of the 3rd International Workshop on Meta-Programming in Logic
META-92 Proceedings of the 3rd International Workshop on Meta-Programming in Logic
LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Computational Reflection in the Calculus of Constructions and its Application to Theorem Proving
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Advanced Functional Programming, Second International School-Tutorial Text
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Computational Metatheory in Nuprl
Proceedings of the 9th International Conference on Automated Deduction
A Fixedpoint Approach to Implementing (Co)Inductive Definitions
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automated Theorem Proving in a Simple Meta-Logic for LF
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Logic for Reasoning with Higher-Order Abstract Syntax
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Reflection and semantics in LISP
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two)
The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two)
Proceedings of the 2006 ACM symposium on Applied computing
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Science of Computer Programming
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Meta-Logical Frameworks and Formal Digital Libraries
Verified Software: Theories, Tools, Experiments
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Parameterized metareasoning in membership equational logic
Formal modeling
Automatic verification of a model checker by reflection
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
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 theories always have initial models and they support reflective and parameterized reasoning.We develop this thesis both abstractly and concretely. Abstractly, we formalize our proposal as a set of requirements and explain how any logic satisfying these requirements can be used for metalogical reasoning. Concretely, we present membership equational logic as a particular metalogic that satisfies these requirements. Using membership equational logic, and its realization in the Maude system, we show how reflection can be used for different, nontrivial kinds of formal metatheoretic reasoning. In particular, one can prove metatheorems that relate theories or establish properties of parameterized classes of theories.