Programs and Datatypes

Autor:	Netty van Gasteren, Roland Backhouse, Henk Doornbos
Rok vydání:	1997
Předmět:	Class (computer programming) Process (engineering) Programming language Section (archaeology) Computer science Software construction Parse tree Subject (documents) Context (language use) Relation algebra computer.software_genre computer
Zdroj:	Relational Methods in Computer Science ISBN: 9783211829714 Relational Methods in Computer Science
DOI:	10.1007/978-3-7091-6510-2_10
Popis:	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].
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::acbe24cf98f0454d3e8414a6222b5a2e https://doi.org/10.1007/978-3-7091-6510-2_10 Zobrazit plný text záznamu