A Connotational Theory of Program Structure


Book Description

This book presents developments of a language independent theory of program structure. The theory features a simple, natural notion of control structure which is much broader than in other theories of programming languages such as denotational semantics and program schemes. This notion permits treatment of control structures which involve not only the denotation of programs (i.e., their input/output behavior), but also their structure, size, run times, etc. The theory also treats the relation of control structure and complexity properties of programming languages. The book focuses on expressive interdependencies of control structures (which control structures can be expressed by which others). A general method of proving control structures expressively independent is developed. The book also considers characterizations of the expressive power of general purpose programming languages in terms of control structures. Several new characterizations are presented and two compactness results for such characterizations are shown.




Complexity Theory Retrospective


Book Description

In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.




Computation and Logic in the Real World


Book Description

This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007. The 50 revised full papers presented together with 36 invited papers were carefully reviewed and selected from 167 submissions.




Trends, Techniques, and Problems in Theoretical Computer Science


Book Description

Aerodynamics and hydrodynamics are still the main domains that make greater use of flow visualization and classical optical techniques such as schlieren and interferometry than of more recent techniques such as holography speckle, laser light sheets, laser-induced tracers and laser-induced fluorescence. A number of studies are now under way on turbulent and vortex flows, within boundary layers or wakes, in the mixing layer of two flows. Other studies concern jets, two-phase flows and air-water interface. To review and discuss developments in flow visualization, four international symposia have been held. Following Tokyo, Bochum and Ann Arbor, the Fourth International Symposium on Flow Visualization (ISFV 4) was held in Paris in August 1986.




STACS 99


Book Description

This book constitutes the refereed proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 99, held in Trier, Germany in March 1999. The 51 revised full papers presented were selected from a total of 146 submissions. Also included are three invited papers. The volume is divided in topical sections on complexity, parallel algorithms, computational geometry, algorithms and data structures, automata and formal languages, verification, algorithmic learning, and logic in computer science.




A Recursive Introduction to the Theory of Computation


Book Description

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.




Logic Programming '87


Book Description

This volume contains most of the papers presented at the 6th Logic Programming Conference held in Tokyo, June 22-24, 1987. It is the successor of Lecture Notes in Computer Science volumes 221 and 264. The contents cover foundations, programming, architecture and applications. Topics of particular interest are constraint logic programming and parallelism. The effort to apply logic programming to large-scale realistic problems is another important subject of these proceedings.




Automata, Languages and Programming


Book Description

This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, cryptography, and theory of robotics.




Foundations of Logic and Functional Programming


Book Description

This volume consists of some of the papers that were delivered during the workshop on "Foundations of Logic and Functional Programming" held in Trento, Italy, from December 15th to 19th, 1986. The meeting centered on themes and trends in Functional Programming and in Logic Programming. This book contains five papers contributed by the invited speakers and five selected contributions.




Analogical and Inductive Inference


Book Description

This volume contains the text of the five invited papers and 16 selected contributions presented at the third International Workshop on Analogical and Inductive Inference, AII `92, held in Dagstuhl Castle, Germany, October 5-9, 1992. Like the two previous events, AII '92 was intended to bring together representatives from several research communities, in particular, from theoretical computer science, artificial intelligence, and from cognitive sciences. The papers contained in this volume constitute a state-of-the-art report on formal approaches to algorithmic learning, particularly emphasizing aspects of analogical reasoning and inductive inference. Both these areas are currently attracting strong interest: analogical reasoning plays a crucial role in the booming field of case-based reasoning, and, in the fieldof inductive logic programming, there have recently been developed a number of new techniques for inductive inference.