ML Anthology

A Natural Programming Calculus

Åke Hansson, Sten-Åke Tärnlund
IJCAI 1979 pp. 348-355
/ijcai/1979/hansson1979ijcai-natural/

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.

Semantic Scholar

Cite

Text

Hansson and Tärnlund. "A Natural Programming Calculus." International Joint Conference on Artificial Intelligence, 1979.

Markdown

[Hansson and Tärnlund. "A Natural Programming Calculus." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/hansson1979ijcai-natural/)

BibTeX

@inproceedings{hansson1979ijcai-natural,
  title     = {{A Natural Programming Calculus}},
  author    = {Hansson, Åke and Tärnlund, Sten-Åke},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1979},
  pages     = {348-355},
  url       = {https://mlanthology.org/ijcai/1979/hansson1979ijcai-natural/}
}