Louise A. Dennis, Alan Smaill  Home/Search
Context
Related
| cs.nott.ac.uk/~lad/ordinals.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: cs.nott.ac.uk/~lad/cv (more) Homepages: L.Dennis |
Rate this article:      (best)Comment on this article |
Abstract: This paper reports a case study in the use of proof planning in the context of higher order syntax. Rippling is a heuristic for guiding rewriting steps in induction that has been used successfully in proof planning inductive proofs using first order representations. Ordinal arithmetic provides a natural set of higher order examples on which transfinite induction may be attempted using rippling. Previously Boyer-Moore style automation could not be applied to such domains. We demonstrate that a... (Update)
Similar documents (at the sentence level):
32.6%: Ordinal Arithmetic: A Case Study for Rippling in a Higher.. - Smaill, Dennis (2001) (Correct)
29.2%: User/Programmer Manual for the Clam proof planner, v.3.0 - Dennis (2001) (Correct)
Active bibliography (related documents): More All
0.5: Using Proof in Transformation Synthesis for Automatic.. - Cook (2001) (Correct)
0.2: Semantics and Syntax for Ordinal Notations and Hierarchies - Bonfante, Cichon, Lamarche (Correct)
0.2: Constructing Orders By Means of Inductive Definitions - Bonfante, Lamarche (Correct)
Similar documents based on text: More All
0.6: A Comparison of Two Systems of Ordinal Notations - Simmons (Correct)
0.5: Continuations of Proof Strategies - Richardson, Smaill (Correct)
0.5: A Semantics for Proof Plans with Applications to Interactive.. - Richardson (2002) (Correct)
BibTeX entry: (Update)
@article{ dennis01ordinal,
author = "Louise A. Dennis and Alan Smaill",
title = "Ordinal Arithmetic: {A} Case Study for Rippling in a Higher Order Domain",
journal = "Lecture Notes in Computer Science",
volume = "2152",
pages = "185+",
year = "2001",
url = "citeseer.ist.psu.edu/476097.html" }
Citations (may not include all citations):353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
334 A Computational Logic Handbook (context) - Boyer, Moore - 1988
226 The use of explicit plans to guide inductive proofs - Bundy - 1988
191 Lego proof development system: User's manual (context) - Luo, Pollack - 1992
168 Rippling: A heuristic for guiding inductive proofs - Bundy, Stevens et al. - 1993
99 IMPS : an interactive mathematical proof system - Farmer, Guttman et al. - 1993
58 Naive Set Theory (context) - Halmos - 1960
38 Axiomatic Set Theory (context) - Suppes - 1960
38 System description: proof planning in higher-order logic wit.. - Richardson, Smaill et al. - 1998
33 A calculus for and termination of rippling - Basin, Walsh - 1996
31 Elements of Set Theory (context) - Enderton - 1977
17 Mechanizing set theory: cardinal arithmetic and the axiom of.. - Paulson, Grabczewski - 1996
16 A logic programming approach to implementing higher-order te.. - Felty - 1992
10 Higher-order annotated terms for proof search - Smaill, Green - 1996
7 eorie des Constructions (context) - Coquand - 1985
7 The automation of proof by mathematical induction - Bundy - 1998
6 sets and axioms: the apparatus of mathematics (context) - Hamilton - 1982
5 Set theory for verication: II (context) - Paulson - 1995
4 An ordinal calculus for proving termination in term rewritin.. - Cichon, Touzet - 1996
2 PVS : An integrated approach to speci- cation and verication (context) - Owre, Rushby et al. - 1992
1 Satisability of systems of ordinal notations with the subter.. (context) - Jouannaud, Okada - 1991
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