Jason Hickey, Aleksey Nogin  Home/Search
Context Related
| cornell.edu/jyh/papers/cade1...paper.ps 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: cornell.edu/jyh/papers/...default (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose meta-language to implement both general-purpose reasoning and computationally intensive domain-specific proof procedures. The generality of tactic provers has a performance penalty (Update)
Context of citations to this paper: More
...data structures transparently. MetaPRL has been heavily optimized; current implementations achieve several millions of rewrites per second [16] on an Intel 400MHz Pentium II. 3 Language specification with Phobos A typical Phobos language definition has these parts:...
...contains a binding occurrence: the variable x is bound in the subterm b. The rewriting engine used in MetaPRL is described in Hickey [9]. Rewriting rules are specified as a pair of terms t 1 t 2 using second order substitution. The term t 1 , called the redex, contains second...
Cited by: More
MetaPRL - A Modular Logical Environment - Hickey, Nogin, Constable.. (2003) (Correct)
Reflection and Propositions-as-Types - Artemov, Barzilay, Constable, Nogin (Correct)
Phobos: A front-end approach to extensible compilers - Granicz, Hickey (2003) (Correct)
Similar documents (at the sentence level):
44.5%: Fast Tactic-based Theorem Proving - Hickey, Nogin (Correct)
33.1%: Theory and Implementation of an Efficient Tactic-Based Logical.. - Nogin (2002) (Correct)
Active bibliography (related documents): More All
0.2: Explanation and Justification of Proposed Expenditures - Continuing Support For (Correct)
0.1: Fault-Tolerant Distributed Theorem Proving - Hickey (1999) (Correct)
0.1: Formal Objects in Type Theory Using Very Dependent Types - Hickey (1996) (Correct)
Similar documents based on text: More All
0.8: A Listing of MetaPRL Theories - Hickey, Aydemir, Bryukhov, Kopylov.. (2003) (Correct)
0.4: Formal Compiler Implementation in a Logical Framework - Hickey, Nogin, Granicz.. (2003) (Correct)
0.4: Quotient Types - a Modular Approach - Nogin (2001) (Correct)
Related documents from co-citation: More All
5: Sequent schema for derived rules (context) - Nogin, Hickey
5: The MetaPRL Logical Programming Environment (context) - Hickey - 2001
4: The semantics of reflected proof - Allen, Constable et al. - 1990
BibTeX entry: (Update)
J. Hickey & A. Nogin. Fast tactic-based theorem proving. In J. Harrison & M. Aagaard, eds., TPHOLs http://citeseer.ist.psu.edu/article/hickey00fast.html More
@inproceedings{ hickeynogin00,
title = "Fast Tactic-based Theorem Proving",
author = "Jason J. Hickey and Aleksey Nogin",
editor = "J. Harrison and M. Aagaard",
booktitle = "Theorem Proving in Higher Order Logics:
13th International Conference, TPHOLs 2000",
series = "Lecture Notes in Computer Science",
volume = 1869,
year = 2000,
publisher = "Springer-Verlag",
pages = "252--266",
url = "citeseer.ist.psu.edu/article/hickey00fast.html" }
Citations (may not include all citations):392 A Computational Logic (context) - Boyer, Moore - 1979
143 The coq proof assistant user's guide (context) - Dowek, Felty et al. - 1993
126 Introduction to HOL (context) - Gordon, Melham - 1993
88 A Tutorial Introduction to PVS (context) - Crow, Owre et al. - 1995
81 Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
60 An industrial strength theorem prover for a logic based on c.. - Kaufmann, Moore - 1997
60 Contraction-free sequent calculi for intuitionistic logic (context) - Dyckhoff - 1992
53 The semantics of reflected proof - Allen, Constable et al. - 1990
44 The type theoretic interpretation of constructive set theory.. (context) - Aczel - 1986
41 Objective ML: A simple object--oriented extension of ML (context) - R'emy, Vouillon - 1997
25 Type Theory and Programming - Coquand, Nordstrom et al. - 1994
15 Implementing Mathematics in the NuPRL Proof Development Syst.. (context) - Constable - 1986
15 The Boyer-Moore prover and Nuprl: An experimental comparison - Basin, Kaufmann - 1991
13 Nuprl-Light: An implementation framework for higher--order l.. - Hickey - 1997
13 HOL Light: A tutorial introduction - Harrison - 1996
10 A Logic for Correct Program Development (context) - Bates - 1979
5 A type annotation scheme for Nuprl - Howe - 1998
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