论文信息 - A Natural Programming Calculus

A Natural Programming Calculus

We shall lay down a programming calculus in which we develop a methodology for reasoning about data and programs. Our language, L, is ordinary first order predicate logic. A subset of this language, Lp, is our programming language that can be run efficiently in PROLOG. The calculus consists of a natural deduction system that is used for deducing programs and a system for efficient computation of programs. The axioms of the calculus characterize the data structures. Definitions are used for program specifications and mappings between data structures. The programs are deduced from the axioms and the definitions. Examples of deduced programs are a LISP-program and a program that Burstall and Darlington could not obtain in their transformation system.

Sten-Åke Tärnlund | Åke Hansson

[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2] Robert S. Boyer,et al. Proving Theorems about LISP Functions , 1973, JACM.

[3] Robert Cartwright,et al. A Practical Formal Semantic Definition and Verification System for TYPED LISP , 1976, Outstanding Dissertations in the Computer Sciences.

[4] Sten-Åke Tärnlund,et al. Horn clause computability , 1977, BIT.

[5] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.

[6] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[7] Patrick J. Hayes,et al. Computation and Deduction , 1973, MFCS.

[8] Sten-Åke Tärnlund,et al. An Axiomatic Data Base Theory , 1977, Logic and Data Bases.

[9] Zohar Manna,et al. Introduction to mathematical theory of computation , 1972 .