John Harrison University of Cambridge Computer Laboratory New Museums Site...  Home/Search
Context Related
| cl.cam.ac.uk/ftp/hvg...Reflection.ps.gz sri.com/tr/crc053/paper.ps.Z sri.com/tr/crc053/paper.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cl.cam.ac.uk/Research/HVG/F...FTP (more) From: sri.com/tr/ABSTRACTS (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One way to ensure correctness of the inference performed by computer theorem provers is to force all proofs to be done step by step in a simple, more or less traditional, deductive system. Using techniques pioneered in Edinburgh LCF, this can be made palatable. However, some believe such an approach will never be efficient enough for large, complex proofs. One alternative, commonly called reflection, is to analyze proofs using a second layer of logic, a metalogic, and so justify abbreviating... (Update)
Context of citations to this paper: More
...in Isabelle: namely, successive refinement of subgoals, and use of a previously proved lemma. A higher order framework allows us to reason about higher and higher meta levels, like the IsDerivable relation itself, without invoking explicit reflection principles [6]. This...
Cited by: More
A Computational Approach to Reflective Meta-Reasoning.. - Nogin, Kopylov, Yu.. (2005) (Correct)
A Foundation for Metareasoning Part I: The Proof Theory - Criscuolo, Giunchiglia.. (2002) (Correct)
Electronic Notes in Theoretical Computer Science 4 (1996) - Reflection And Strategies (Correct)
Similar documents (at the sentence level):
55.4%: Self-Checking Prover Study - Final Report - Gordon, Herbert, Hale.. (1995) (Correct)
Similar documents based on text: More All
0.6: Verifying the Unification Algorithm in LCF - Paulson (1985) (Correct)
0.2: Unknown - The Next Theorem (Correct)
0.2: A Higher-Order Implementation of Rewriting - Paulson (1983) (Correct)
Related documents from co-citation: More All
10: Metalogical frameworks II: Using reflected decision procedures (context) - Aitken, Constable et al. - 1993
9: Rewriting logic as a logical and semantic framework - Mart'i-Oliet, Meseguer
9: Axiomatizing Reflective Logics and Languages - Clavel, Meseguer - 1996
BibTeX entry: (Update)
J. Harrison. Metatheory and reflection in theorem proving: A survey and critique, 1995. http://citeseer.ist.psu.edu/harrison95metatheory.html More
@misc{ harrison95metatheory,
author = "J. Harrison",
title = "Metatheory and reflection in theorem proving: A survey and critique",
text = "J. Harrison. Metatheory and reflection in theorem proving: A survey and
critique, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/harrison95metatheory.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/Research/HVG/FTP/FTP.html): More
Extending the HOL theorem prover with a Computer Algebra System.. - Harrison (1993) (Correct)
Of What Use is a Verified Compiler Specification? - Curzon (1992) (Correct)
Towards Verified Systems - Bowen (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC