A. Ayari and D. Basin. A higher-order interpretation of deductive tableau. Journal of Symbolic Computation, 31(5):487--520, May 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Program Extraction in simply-typed Higher Order Logic - Berghofer (2002) (1 citation) (Correct)
....and predicates. It has recently been extended to produce correctness proofs for extracted programs as well. Moreover, it also supports program extraction from classical proofs [6] Isabelle has already been used for implementing program extraction calculi in the past, too. Basin and Ayari [2] have shown how to simulate Manna and Waldinger s Deductive Tableau in Isabelle HOL. Coen [10] formalized his own Classical Computational Logic , which is tailored speci cally towards program extraction, whereas our framework is applicable to common object logics such as HOL. 7 Conclusion We ....
A. Ayari and D. Basin. A higher-order interpretation of deductive tableau. Journal of Symbolic Computation, 31(5):487-520, May 2001.
An Integration of Deductive Retrieval into Deductive Synthesis - Fischer, Whittle (1999) (4 citations) (Correct)
....larger component libraries. In this paper we investigate the integration of a deductive retrieval system into a deductive synthesis framework in order to maximize the advantages of both approaches. We present our ideas in the context of deductive tableaus reinterpreted in higher order logic as in [2, 3]. Such higherorder frameworks are well suited for the creative aspects of deductive synthesis. They give the designer full control over the emerging system structure as program fragments yet to be synthesized are represented by meta variables, i.e. within the logic itself and not by any ....
....a final row true t or, by duality, false t provided that the output term t is ground and built up entirely from primitive (i.e. executable) function symbols; t can then be extracted as the final program. 2.1.2. Re interpretation of deductive tableaus in higherorder logics. Ayari and Basin [3] have pointed out that the original version of deductive tableaus suffers from some inherent technical limitations. Since proofs in the deductive tableaus calculus are sequences rather than trees, rules that split a tableau into multiple sub tableaus are not allowed and must be encoded using ....
[Article contains additional citation context not shown here]
A. Ayari and D. Basin. "A higher-order interpretation of deductive tableau", Tech. report, Univ. Freiburg, 1999.
Program Extraction in simply-typed Higher Order Logic - Berghofer (2002) (1 citation) (Correct)
No context found.
A. Ayari and D. Basin. A higher-order interpretation of deductive tableau. Journal of Symbolic Computation, 31(5):487--520, May 2001.
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