Relational programming laws in the tree, list, bag, set hierarchy

P.F. Hoogendijk; R.C. Backhouse

doi:10.1016/0167-6423(94)90008-6

Relational programming laws in the tree, list, bag, set hierarchy

P.F. Hoogendijk
, R.C. Backhouse

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

9 Citations (Scopus)

Abstract

In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalized within a relational theory of datatypes. The two methods to which we refer are the so-called "Bird-Meertens formalism" for the construction of functional programs and the "Dijkstra-Feijen calculus" for the construction of imperative programs.

Original language	English
Pages (from-to)	67-105
Journal	Science of Computer Programming
Volume	22
Issue number	1-2
DOIs	https://doi.org/10.1016/0167-6423(94)90008-6
Publication status	Published - 1994

Access to Document

10.1016/0167-6423(94)90008-6

Cite this

@article{53e07f69b0504dc9a13b1f07ca41c15f,

title = "Relational programming laws in the tree, list, bag, set hierarchy",

abstract = "In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalized within a relational theory of datatypes. The two methods to which we refer are the so-called {"}Bird-Meertens formalism{"} for the construction of functional programs and the {"}Dijkstra-Feijen calculus{"} for the construction of imperative programs.",

author = "P.F. Hoogendijk and R.C. Backhouse",

year = "1994",

doi = "10.1016/0167-6423(94)90008-6",

language = "English",

volume = "22",

pages = "67--105",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Relational programming laws in the tree, list, bag, set hierarchy

AU - Hoogendijk, P.F.

AU - Backhouse, R.C.

PY - 1994

Y1 - 1994

N2 - In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalized within a relational theory of datatypes. The two methods to which we refer are the so-called "Bird-Meertens formalism" for the construction of functional programs and the "Dijkstra-Feijen calculus" for the construction of imperative programs.

AB - In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalized within a relational theory of datatypes. The two methods to which we refer are the so-called "Bird-Meertens formalism" for the construction of functional programs and the "Dijkstra-Feijen calculus" for the construction of imperative programs.

U2 - 10.1016/0167-6423(94)90008-6

DO - 10.1016/0167-6423(94)90008-6

M3 - Article

SN - 0167-6423

VL - 22

SP - 67

EP - 105

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 1-2

ER -

Relational programming laws in the tree, list, bag, set hierarchy

Abstract

Access to Document

Fingerprint

Cite this