A Connotational Theory of Program Structure
A Connotational Theory of Program Structure

Author: James S. Royer

Publisher: Springer Science & Business Media

Published: 1987-08-26

Total Pages: 196

ISBN-13: 9783540182535

DOWNLOAD EBOOK

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.

A Connotational Theory of Program Structure
A Connotational Theory of Program Structure

Author: James S. Royer

Publisher: Springer

Published: 2014-03-12

Total Pages: 188

ISBN-13: 9783662176245

DOWNLOAD EBOOK

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.

Logic Programming '87
Logic Programming '87

Author: Koichi Furukawa

Publisher: Springer Science & Business Media

Published: 1988-06-22

Total Pages: 340

ISBN-13: 9783540194262

DOWNLOAD EBOOK

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
Automata, Languages and Programming

Author: Timo Lepistö

Publisher: Springer Science & Business Media

Published: 1988

Total Pages: 762

ISBN-13: 9783540194880

DOWNLOAD EBOOK

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
Foundations of Logic and Functional Programming

Author: Mauro Boscarol

Publisher: Springer Science & Business Media

Published: 1988-04-27

Total Pages: 228

ISBN-13: 9783540191292

DOWNLOAD EBOOK

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
Analogical and Inductive Inference

Author: Klaus P. Jantke

Publisher: Springer Science & Business Media

Published: 1992-09-23

Total Pages: 340

ISBN-13: 9783540560043

DOWNLOAD EBOOK

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.

ECOOP '88 European Conference on Object-Oriented Programming
ECOOP '88 European Conference on Object-Oriented Programming

Author: Stein Gjessing

Publisher: Springer Science & Business Media

Published: 1988-07-19

Total Pages: 418

ISBN-13: 3540500537

DOWNLOAD EBOOK

The field of Object-Oriented Programming (OOP) has attracted increasing attention during the last few years. OOP is now recognized as an important tool for making better and more flexible information systems. This book is the proceedings of the second European Conference on Object-Oriented Programming (ECOOP '88) that was held in Oslo, Norway, from August 15 to 17, 1988. The objectives of ECOOP '88 were to present the best international work in the field of OOP to interested persons from industry and academia, and to be a forum for the exchange of ideas and the growth of professional relationships. Each of the 103 papers submitted was subject to a thorough refereeing process. The 22 papers selected are collected in these proceedings together with one invited paper. These 23 papers from 13 different countries comprise the currently best international work in the field of OOP. The contents of the papers include areas such as: Theory, Languages, Didactics, Implementation, Applications, Concurrency and Databases. The interest in object-oriented programming is rapidly increasing, especially within the areas of Concurrency and Databases. With its 5 papers on concurrency and 7 papers on databases, the proceedings contain important new material on these subjects. This book is a must for persons who want to keep themselves up to date in the field of OOP.

Modified Branching Programs and Their Computational Power
Modified Branching Programs and Their Computational Power

Author: Christoph Meinel

Publisher: Springer Science & Business Media

Published: 1989-07-12

Total Pages: 146

ISBN-13: 9783540513407

DOWNLOAD EBOOK

Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration.

Logical Foundations of Computer Science
Logical Foundations of Computer Science

Author: Sergei Artemov

Publisher: Springer

Published: 2013-01-05

Total Pages: 424

ISBN-13: 3642357229

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

A Recursive Introduction to the Theory of Computation
A Recursive Introduction to the Theory of Computation

Author: Carl Smith

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 155

ISBN-13: 1441985018

DOWNLOAD EBOOK

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.