Tapsoft 87

This volume contains the papers which were presented to the workshop "Computer-Science Logic" held in Karlsruhe on October 12-16, 1987. Traditionally Logic, or more specifically, Mathematical Logic splits into several subareas: Set Theory, Proof Theory, Recursion Theory, and Model Theory. In addition there is what sometimes is called Philosophical Logic which deals with topics like nonclassical logics and which for historical reasons has been developed mainly at philosphical departments rather than at mathematics institutions. Today Computer Science challenges Logic in a new way. The theoretical analysis of problems in Computer Science for intrinsic reasons has pointed back to Logic. A broad class of questions became visible which is of a basically logical nature. These questions are often related to some of the traditional disciplines of Logic but normally without being covered adequately by any of them. The novel and unifying aspect of this new branch of Logic is the algorithmic point of view which is based on experiences people had with computers. The aim of the "Computer-Science Logic" workshop and of this volume is to represent the richness of research activities in this field in the German-speaking countries and to point to their underlying general logical principles.

In October 1983 an informal meeting was organized in Le Cap d'Agde with the help of the BIGRE bulletin. Sixty people turned out to hear more than ten presentations on object-oriented programming. More important was their unanimous demand for other, more structured encounters. So, about one year later, the Object group was created by AFCET. A second workshop was organized in Brest, and again one year later in Paris, each time showing increased attendance and interest. The success of these meetings and the fact that similar activities were taking place in other European countries, especially Great Britain and Germany, led to the idea of an annual European Conference, providing a forum for theorists and practitioners interested in the object-oriented programming paradigm. It is impossible to acknowledge here all the people and organizations that welcomed with great enthusiasm the birth of the ECOOP conference and contributed to its organization. More than a hundred submissions were received and the program committee had the unpleasant task of turning down many valuable contributions. We hope, however, that the selection of papers for ECOOP'87 emphasizes the fundamental issues and problems of object-oriented programming and will point toward interesting future research directions.

This volume contains abridged versions of most of the sectional talks and some invited lectures given at the International Conference on Fundamentals of Computation Theory held at Kazan State University, Kazan, USSR, June 22-26, 1987. The conference was the sixth in the series of FCT Conferences organized every odd year, and the first one to take place in the USSR. FCT '87 was organized by the Section of Discrete Mathematics of the Academy of Sciences in the USSR, the Moscow State University (Department of Discrete Mathematics), and the Kazan State University (Department of Theoretical Cybernetics). This volume contains selected contributions to the following fields: Mathematical Models of Computation, Synthesis and Complexity of Control Systems, Probabilistic Computations, Theory of Programming, Computer-Assisted Deduction. The volume reflects the fact that FCT '87 was organized in the USSR: A wide range of problems typical of research in Mathematical Cybernetics in the USSR is comprehensively represented.

Highly sensitive systems which are widely used in molecular biological & biomedical laboratories, such as colorimetric, luminescence, fluorescence measuring using antibody-antigen binding or hybridisation, as well as PCR amplification are described in detail.

This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.