A natural programming calculus

Authors:
Ake Hansson;Sten-Ake Tarnlund
Affiliations:
Department of Computer Science, University of Stockholm and The Royal Institute of Technology, Stockholm, Sweden;Department of Computer Science, University of Stockholm and The Royal Institute of Technology, Stockholm, Sweden
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Year:
1979

Citing 5
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Proving Theorems about LISP Functions

Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Human Problem Solving

Human Problem Solving

First order compiler: A deterministic logic program synthesis algorithm

Journal of Symbolic Computation

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.