Programs and datatypes

H. Doornbos, A.J.M. Gasteren, van, R.C. Backhouse

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

1 Downloads (Pure)

Abstract

We are programmers, in the sense that it is our concern to improve the process of program construction. Therefore we want to answer questions like: What is programming, why is it so difficult and error-prone, and how can we learn what is needed to make the process more manageable? In the following we shall address these issues in a relational framework. Section 10.1 gives an introductory overview explaining the background to our approach. Section 10.2 shows how we deal with (recursive and non-recursive) datatypes in the relational framework. Section 10.3 discusses programs in this context, concentrating on a class of programs characterized by relational equations of a specific but quite general shape. Program termination is the subject of Section 10.4. Finally, Section 10.5 briefly touches on the design and execution of (terminating) programs. For a more extensive treatment see [Doornbos 1996].
Original languageEnglish
Title of host publicationRelational methods in computer science
EditorsC.H. Brink, W. Kahl, G. Schmidt
PublisherSpringer
Pages150-165
ISBN (Print)3-211-82971-7
Publication statusPublished - 1997

Publication series

NameAdvances in Computing Science
ISSN (Print)1433-0113

Cite this