# Automating Meta-Theory Creation and System Extension

@inproceedings{Basin1991AutomatingMC, title={Automating Meta-Theory Creation and System Extension}, author={David A. Basin and Fausto Giunchiglia and Paolo Traverso}, booktitle={AI*IA}, year={1991} }

In this paper we describe a first experiment with a new approach for building theorem provers that can formalize themselves, reason about themselves, and safely extend themselves with new inference procedures. Within the GETFOL system we have built a pair of functions that operate between the system's implementation and a theory about this implementation. The first function lifts the actual inference rules to axioms that comprise a theory of GETFOL's inference capabilities. This allows us to…

## 7 Citations

Valid extensions of introspective systems: a foundation for reflective theorem provers

- Computer Science
- 1994

This paper proposes to use structured algebraic speci cations to describe the embedded account of introspective systems and shows that extending such an introspective system in a valid manner can be reduced to development of correct software.

Valid Extensions of Introspective Systems: a Foundation for Reeective Theorem Provers Universit at Karlsruhe Valid Extensions of Introspective Systems: a Foundation for Reeective Theorem Provers

- Computer Science
- 1994

This paper proposes to use structured algebraic speciications to describe the embedded account of introspective systems and proves correctness of the mechanism and reports on experiences made with its realization in the KIV system (Karlsruhe Interactive Veriier).

An Explanatory Framework for Human Theorem Proving

- Computer ScienceGWAI
- 1992

A computational theory accounting for human formal deductive competence is presented, which cast the cognitive activities involved in theorem proving as an interleaving process of metalevel planning and object level verification.

Metatheory and Reflection in Theorem Proving: A Survey and Critique

- Computer Science
- 1995

This paper puts forward arguments to suggest that the inadequacy of the fully-expansive LCF approach has not been adequately demonstrated, and neither has the practical utility of reflection (notwithstanding its undoubted intellectual interest).

Max-planck-institut F ¨ Ur Informatik Metalogical Frameworks I N F O R M a T I K Authors' Addresses Publication Notes

- Computer Science
- 2013

It is shown that by taking the view that the metalogic is primary, these other parts of the logic are related in standard ways and can be seen as an approach to the task of finding a generic way to present logics and their implementations, which is for example the goal of the Edinburgh Logical Frameworks effort.

Max-planck-institut F Ur Informatik Metalogical Frameworks K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes

- Computer Science
- 2007

It is shown that by taking the view that the metalogic is primary, these other parts of the logic are related in standard ways and can be seen as an approach to a generic way to present logics and their implementations, which is for example the goal of the Edinburgh Logical Frameworks.

## References

SHOWING 1-10 OF 12 REFERENCES

Reflective Reasoning with and between a Declarative Metatheory and the Implementation Code

- Computer ScienceIJCAI
- 1991

A logical declarative metatheory MT is defined which can be put in a one-to-one relation with the code and automatically generated from it, and which opens up the possibility of deriving control strategies automatically by metatheoretic theorem proving and thus of extending and modifying the system itself.

Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures.

- Computer Science
- 1979

It is demonstrated that if the statement of correctness for a given 'metafunction' is proved, then the code derived from function's definition can be used as a new proof procedure, and how the actual application of a metafunction is as efficient as hand-coded procedures in the implementation language is explained.

Reflection and semantics in LISP

- Computer SciencePOPL '84
- 1984

This paper presents a general architecture, called procedurcd refh'ctio, to support sell'directed reosoning in a serial programming lmaguage, which apparently infinite architecture can be finitely implemented.

Implementing mathematics with the Nuprl proof development system

- Mathematics
- 1986

This ebook presents full variant of this ebook in DjVu, PDF, ePub, doc, txt forms, and on the website you may read guides and different art eBooks online, either downloading or downloading.

Plan formation and execution in an uniform architecture of declarative metatheories

- Proc. Workshop on Meta-Programming in Logic
- 1990

Extending Re ective Architectures

- Proc . Workshop on MetaProgramming in Logic
- 1990

Extending Reeective Architectures

- Proc. IJCAI 89
- 1989

Meta-Theory as the Dual of System Implementation

- Meta-Theory as the Dual of System Implementation
- 1991