| : P. Madden. The Specialization of Constructive Existence Proofs forthcoming Discussion paper January 1988. |
....implemented, sub domain of the proof transformation field (section 4) However, a brief account of the more general proof transformation approach to program optimization 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 relationship, is represented by a statement in constructive logic, specifically, Martin Lof type theory. The Martin Lof type theory is a constructive, higher ....
.... example, adapting a sorting algorithm or a bin packing algorithm to operate, with maximum efficiency, on input lists of a specific length) Goad s system has been successfully reconstructed, and extended, in the Oyster proof refinement environment and subjected to test on a number of examples [Madden 88 2] The main feature of this specialization system is an openended set of pruning transformation operators which are guaranteed to reduce the size of the source proof and corresponding source algorithm. The pruning mechanism, which need not be limited to specialization, is designed to remove those ....
: P. Madden. The Specialization of Constructive Existence Proofs forthcoming Discussion paper January 1988.
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