Axiomatizing Re ective Logics and Languages

  title={Axiomatizing Re ective Logics and Languages},
  author={Manuel Clavel},
The very success and breadth of re ective techniques underscores the need for a general theory of re ection. At present what we have is a wide-ranging variety of re ective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of re ective systems in a formalismindependent way. This paper proposes metalogical axioms for re ective logics and declarative languages based on the theory of general logics [34]. In this way… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 49 references

Towards a foundation of computational re ection based on abstract rewrit- ing (preliminary result)

Takuo Watanabe
In IMSA'95, • 1995
View 4 Excerpts
Highly Influenced

The Concept of a Supercompiler

ACM Trans. Program. Lang. Syst. • 1986
View 7 Excerpts
Highly Influenced

Conditioned Rewriting Logic as a United Model of Concurrency

Theor. Comput. Sci. • 1992
View 4 Excerpts
Highly Influenced

Analysis of Meta-Programs

View 6 Excerpts
Highly Influenced

Efficient Self-Interpretations in lambda Calculus

J. Funct. Program. • 1992
View 3 Excerpts
Highly Influenced

Computational Lambda-Calculus and Monads

LICS • 1989
View 3 Excerpts
Highly Influenced

Rewriting logic as a logical and semantic framework

Electr. Notes Theor. Comput. Sci. • 1996
View 2 Excerpts

Computational re ection in the calculus of constructions and its application to theorem proving

Harald Rue
View 1 Excerpt

Similar Papers

Loading similar papers…