PROGRAMS AND THEIR PROOFS: AN ALGEBRAIC APPROACH,

Abstract

Results are presented of some applications of universal algebra and automata theory to programming problems. A method of defining some functions as homomorphisms instead of giving recursive or iterative definitions is explained. As a demonstration of the use of this approach, a proof of the correctness of a simple compiler for expressions is given. The method of description is closely related to the methods of proving theorems about the objects described. The report includes a section on basic algebraic concepts as background for the applications, and a section in which functions commonly encountered in programming are expressed as homomorphisms. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1968
Accession Number
AD0687498

Entities

People

  • Peter J. Landin
  • Rodney M. Burstall

Organizations

  • RCA Corporation

Tags

DTIC Thesaurus Topics

  • Artificial Intelligence
  • Automata
  • Automata Theory
  • Compilers
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Cooperation
  • Demonstrations
  • Machines
  • Perception
  • Psychological Phenomena And Processes
  • Psychology
  • Scotland

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computer Science.
  • Mathematical Modeling and Probability Theory.