Peter Madden October 22, 1993  Home/Search
Context Related
| dream.dai.ed.ac.uk/public...rp406.ps.gz 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: dream.dai.ed.ac.uk...indexpre96 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper contains a discussion, and reconstruction, of Goad's proof transformation system. Information contained in constructive existence proofs, which goes beyond that needed for simple execution, is exploited in the adaption of algorithms to special situations. Goad's system is reconstructed, and extended, in the Oyster proof refinement environment and subjected to test on a number of examples. Differences in methodology between Goad's system and the reconstruction are discussed. In... (Update)
Context of citations to this paper: More
...is provided to set the specialization research in context. For a detailed account of the proof transformation research see [Madden 88 2] Section 5 contains a brief summary. 2 The Environment Within Oyster, a program specification, comprising the desired input output...
Cited by: More
The Specialization and Transformation of Constructive.. - Peter Madden Department (1989) (Correct)
Active bibliography (related documents): More All
1.0: A summary for the application to the 1988 Alvey - Conference Peter Madden (Correct)
0.2: The Use of Proof Plans for Transformation of Functional.. - Richardson (1996) (Correct)
0.2: Proceedings Of The First Workshop On Logical Frameworks.. - G. Huet, G. Plotkin (Eds.) (1990) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: DIPLOMAT: Compiling prioritized default rules into ordinary logic .. - Grosof (1999) (Correct)
0.4: DIPLOMAT: compiling Prioritized Default Rules into Ordinary Logic .. - Grosof (1999) (Correct)
0.2: The International Expansion of the Norwegian Banks - Jacobsen, Tschoegl (Correct)
BibTeX entry: (Update)
: P. Madden. The Specialization of Constructive Existence Proofs forthcoming Discussion paper January 1988. http://citeseer.ist.psu.edu/madden88specialization.html More
@misc{ madden88specialization,
author = "P. Madden",
title = "The Specialization of Constructive Existence Proofs forthcoming Discussion
paper January",
text = ": P. Madden. The Specialization of Constructive Existence Proofs forthcoming
Discussion paper January 1988.",
year = "1988",
url = "citeseer.ist.psu.edu/madden88specialization.html" }
Citations (may not include all citations):505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1985
392 A Computational Logic (context) - Boyer, Moore - 1979
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
226 The Use of Explicit Plans to Guide Inductive Proofs - Bundy - 1988
141 Constructive Mathematics and Computer Programming (context) - Martin-Lof - 1982
97 Experiments with Proof Plans for Induction - Bundy, van Harmelen et al. - 1988
29 An Experimental Program Transformation and Synthesis System (context) - Darlington - 1981
18 Transformational Logic Program Synthesis (context) - Tamaki, Sato - 1984
11 Solving symbolic equations with PRESS (context) - Bundy, Byrd et al. - 1982
11 A Transformation System for Logic Programs Which Preserves E.. (context) - Tamaki, Sato - 1983
5 Recursive Functions (context) - Peter - 1967
4 The NurPRL Proof Development System (context) - Horn - 1988
4 Proof Theory and the Synthesis of Programs: Potentials and L.. (context) - Kreisel - 1985
4 Proofs as Descriptions of Computation (context) - Goad - 1980
3 Learning by analogy: forming and generalizing plans from pas.. (context) - Carbonell - 1983
3 The application of Analogy to Program Optimization (context) - Madden - 1986
3 Automatic Program Optimization via the Transformation of Nup.. (context) - Madden - 1988
2 Logic for problem solving Artificial Intelligence Series (context) - Kowalski - 1979
2 A Survey of Proof Theory J (context) - Kreisel - 1968
2 Discussion paper - Madden, Synthesis et al. - 1988
2 Computational Uses of the Manipulation of Formal Proofs STAN.. (context) - Goad - 1980
2 Heuristics for the automatic transformation of Prolog Progra.. (context) - Grant, Zhang - 1988
2 The Lops Approach to Program Synthesis; A Comparison with Nu.. (context) - Madden - 1988
2 Technical Report no (context) - Constable, Proofs - 1982
2 Bromley Implementing Mathematics with the Nuprl Proof Develo.. (context) - Constable, Allen
1 Lambda Calculus and Formalism pp (context) - de Bruijn, of et al. - 1980
1 Deductive Synthesis of the Unification Algorithm in Science .. (context) - Manna, Waldinger - 1981
1 Generalisation of Oyster Proof Specifications (context) - Hesketh
Documents on the same site (http://dream.dai.ed.ac.uk/publications/index-pre-96.html): More
A Rational Reconstruction and Extension of Recursion.. - Bundy, van Harmelen.. (1992) (Correct)
Towards an Understanding of Hill-climbing Procedures for SAT - Gent, Walsh (1993) (Correct)
The Hardest Random SAT Problems - Gent, Walsh (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