Abstract: "The Mathematical Reasoning Group (MRG) in the Department of Artificial Intelligence at Edinburgh University has developed an approach to the verification and synthesis of programs using proof plans -- high level descriptions of proofs, which control the automatic search for a proof....

Full description

Bibliographic Details

Main Author:	Phillips, Colin (Author)
Format:	Book
Language:	English
Published:	Edinburgh 1991
Series:	University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 559
Subjects:	Computer software Künstliche Intelligenz Artificial intelligence
Summary:	Abstract: "The Mathematical Reasoning Group (MRG) in the Department of Artificial Intelligence at Edinburgh University has developed an approach to the verification and synthesis of programs using proof plans -- high level descriptions of proofs, which control the automatic search for a proof. Constructive mathematics is employed, enabling programs to be derived using the proofs as programs technique. The proofs in question employ various forms of induction and techniques have been developed for automating the search for the form of induction appropriate to a given proof. In this paper I will discuss a modification of this methodology which involves using well-founded induction and the automated search for the appropriate well-founded relation. This is being implemented in a version of Martin-Lof's type theory extended by Nordstrom's Acc Type I shall be comparing this approach with that previously employed in the Mathematical Reasoning group.
Physical Description:	16 S.