Partial Structural Synthesis of Programs

Authors:
Mihhail Matskin;Jan Komorowski
Affiliations:
Department of Computer and Information Science, Norwegian University of Science and Technology, N-7033 Trondheim, Norway. {misha, janko}@idi.ntnu.no;Department of Computer and Information Science, Norwegian University of Science and Technology, N-7033 Trondheim, Norway. {misha, janko}@idi.ntnu.no
Venue:
Fundamenta Informaticae
Year:
1997

Citing 10
Cited 0

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Three new-generation software environments

Communications of the ACM - Special issue: Soviet computing
A syntactic approach to program transformations

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Partial evaluation in logic programming

Journal of Logic Programming
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowledge-Based Programming (Turing Institute Press Knowledge Engineering Tutorial Series)

Knowledge-Based Programming (Turing Institute Press Knowledge Engineering Tutorial Series)
Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987

Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987
Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of partial deduction known from logic programming is defined in the framework of Structural Synthesis of Programs (SSP). Partial deduction for 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.