- Email: [email protected]
Mathematical foundations of computer science 1978: Proceedings 7th symposium, Zakopane, Poland, September 4–8, 1978
364
Book Reviews
J. WlNKOWSKI (Ed.) Mathematical Foundations of Computer Science
1978: Proceedings 7th Symposium,. Zakopane, Poland, September 4 - 8 , 1978 Springer, Berlin, 1978, ix + 551 pages, Dfl. 55.50 Soft cover This volume (Proceedings of the Mathematical Foundation of Computer Science 1978 symposium) contains seven invited lectures and 44 further contributions on three main topics: - the theory of programs and programming languages (24), - the theory of concurrency (13)~ - the theory of data bases (7). The invited lectures are concerned with the connection between model logic and algorithmic logic, algebraic semantics, correctness proofs of a concurrent program, data types, synthesis of communicating behaviour and programming languages as mathematical objects.
These articles are recommended for those who are interested in the state of the art of the cited subjects, but are of marginal intexest to the operational research worker in general. The latter should be much more interested in some special papers about concurrency (with respect to general scheduling problems and applications of graph theory) and a few contributions in the field of data base theory, e.g. on the completeness of query lan. guages for relational data bases, analysis of a universal class of hash functions as an example of (Rabin's) random algorithms, some algebraic approaches for the analysis of information storage and retrieval systems and a nice tutorial survey on the theory of relations for databases. Hartmut NOL TEMEIER R I¢7H Aachen Aachen, Fed. Rep. Germany
Book Reviews
J. WlNKOWSKI (Ed.) Mathematical Foundations of Computer Science
1978: Proceedings 7th Symposium,. Zakopane, Poland, September 4 - 8 , 1978 Springer, Berlin, 1978, ix + 551 pages, Dfl. 55.50 Soft cover This volume (Proceedings of the Mathematical Foundation of Computer Science 1978 symposium) contains seven invited lectures and 44 further contributions on three main topics: - the theory of programs and programming languages (24), - the theory of concurrency (13)~ - the theory of data bases (7). The invited lectures are concerned with the connection between model logic and algorithmic logic, algebraic semantics, correctness proofs of a concurrent program, data types, synthesis of communicating behaviour and programming languages as mathematical objects.
These articles are recommended for those who are interested in the state of the art of the cited subjects, but are of marginal intexest to the operational research worker in general. The latter should be much more interested in some special papers about concurrency (with respect to general scheduling problems and applications of graph theory) and a few contributions in the field of data base theory, e.g. on the completeness of query lan. guages for relational data bases, analysis of a universal class of hash functions as an example of (Rabin's) random algorithms, some algebraic approaches for the analysis of information storage and retrieval systems and a nice tutorial survey on the theory of relations for databases. Hartmut NOL TEMEIER R I¢7H Aachen Aachen, Fed. Rep. Germany