A Higher-order Interpretation of Deductive Tableau

J. Symbolic Computation (1999) 11, 1{39 A Higher-Order Interpretation of Deductive Tableau

The Deductive Tableau of Manna and Waldinger is a formal system with an associated methodology for synthesizing functional programs by existence proofs in classical rst-order theories. We reinterpret the formal system in a setting that is higher-order in two respects: higher-order logic is used to formalize a theory of functional programs and higher-order resolution is used to synthesize progra...

Interpretation of the Deductive Tableau in HOL

Our research investigates frameworks supporting the formalization of programming calculi and their application to deduction-based program synthesis. Here we report on a case study: within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development which can simulate those of the deductive tableau proposed by Manna and Waldinger. We...

A Higher - Order Interpretation

Deductive Translation Validation for a Subset of Higher Order Logic

We discuss a proof-producing compiler for a subset of higher order logic. The translation validation is automatic, and is based on Hoare rules derived from a compositional semantics for sequences of instructions for an ARM-like machine. Partial and total correctness are dealt with. The main focus is on issues in the intermediate level and back-end of the compiler.

A Tableau Compiled Labelled Deductive System for Hybrid Logic

Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...