A Relational Theory of Computing

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): John G. Sanderson (auth.)
Series: Lecture Notes in Computer Science 82
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1980

Language: English
Pages: 147
Tags: Algorithm Analysis and Problem Complexity

Introduction....Pages 1-6
The components of a relational calculus....Pages 7-22
A comparison of some relational calculi....Pages 23-34
Properties of relators....Pages 35-56
The extension of a calculus....Pages 57-71
Types and structures....Pages 72-88
Programs....Pages 89-107
Assignment and efficiency....Pages 108-123
Metatheory....Pages 124-134
Conclusions....Pages 135-138