Partial Deduction in the Framework of Structural Synthesis of Programs

. The notion of partial deduction known from logic programming is defined in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is defined. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested. 1 Introduction The main motivation for this work is to provide incremental formal program development in the framework of the proof-as-programs approach [3, 13]. In our case, it is Structural Synthesis of Programs [16, 20] (hence abbreviation SSP). In SSP, a specification at hand is transformed into a set of formulae of a logical language complete with respect to intuitionistic propositional logic. A problem to be solved is formulated as a theorem to be proven in this logic. A program is then extracted from the proof of the theorem. This approach has been implemented (see, for instance, [21]) and commercialized. It can be further strengt..