A Natural Programming Calculus
Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .
Abstract
We shall lay down a programming calculus in which we develop a methodology for reasoning ab?ut data and programs. Our language, L, is ordinary first order predicate logic. A subset of th~s 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 effcient 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.
@inproceedings{ijcai1979p77,
title = {A Natural Programming Calculus},
author = {Hansson, Åke and Tärnlund, Sten-Åke},
booktitle = {Proceedings of the Sixth International Joint Conference on
Artificial Intelligence, {IJCAI-79}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Bruce G. Buchanan},
year = {1979},
month = {8},
url = {https://ijcai.org/proceedings/1979/77},
}
TY - CPAPER TI - A Natural Programming Calculus AU - Hansson, Åke AU - Tärnlund, Sten-Åke T2 - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79 PB - International Joint Conferences on Artificial Intelligence PY - 1979 UR - https://ijcai.org/proceedings/1979/77 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
