A Higher-Order Implementation of Rewriting

See this document in CiteSeerX!

A Higher-Order Implementation of Rewriting (1983) (Make Corrections) (46 citations)
Lawrence PaulsonScience of Computer Programming

Home/Search Context Related

View or download:
cl.cam.ac.uk./~lcp...lcprewriting.pdf
Cached: PS.gz PS PDF Image Update Help

From: cl.cam.ac.uk./~lcp/pap...refereed (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify the subgoals that arise during a proof. (Update)

Similar documents based on text: More All
0.4: Verifying the Unification Algorithm in LCF - Paulson (1985) (Correct)
0.3: Natural Deduction as Higher-Order Resolution - Paulson (1986) (Correct)
0.2: Unknown - The Next Theorem (Correct)

BibTeX entry: (Update)

Lawrence Paulson. A higher-order implementation of rewriting. Science of Computer Programming, 3:119--149, 1983. http://citeseer.ist.psu.edu/paulson83higherorder.html More

@article{ paulson83higherorder,
    author = "Lawrence C. Paulson",
    title = "A Higher-Order Implementation of Rewriting",
    journal = "Science of Computer Programming",
    volume = "3",
    number = "2",
    pages = "119--149 (or 119--150??)",
    year = "1983",
    url = "citeseer.ist.psu.edu/paulson83higherorder.html" }

Citations (may not include all citations):
392 A Computational Logic (context) - Boyer, Moore - 1979
363 Programming in Prolog (context) - Clocksin, Mellish - 1981
273 Can programming be liberated from the von Neumann style (context) - Backus - 1978
133 Mathematical Theory of Computation (context) - Manna - 1974
39 Artificial Intelligence Programming (context) - Charniak, Riesbeck et al. - 1980
39 Springer-Verlag (context) - Gordon, Milner et al. - 1979
17 Equations and rewrite rules: a survey (context) - Huet, Oppen - 1980
11 Algebraic structures for transitive closure (context) - Lehmann - 1977
9 Representing a logic in the LCF metalanguage (context) - Gordon - 1982
4 The equivalence of two semantic definitions: a case study in.. (context) - Cohn - 1983
2 The revised logic PPLAMBDA: a reference manual (context) - Paulson - 1983
1 Polymorphism MLLCFHOPE Newsletter (context) - The, machine et al. - 1983
1 Recent developments in LCF: examples of structural induction (context) - Paulson - 1983
1 An implementation and investigation of the Knuth-Bendix comp.. (context) - Kuechlin - 1982

The graph only includes citing articles where the year of publication is known.

Documents on the same site (http://www.cl.cam.ac.uk./~lcp/papers/refereed.html): More
Reasoning about Coding Theory: The Benefits We Get from.. - Ballarin, Paulson (Correct)
A Formal Proof of Sylow's Theorem - An Experiment in Abstract .. - Kammüller, al. (1998) (Correct)
A Simple Formalization and Proof for the Mutilated Chess Board - Computer (1996) (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