The interaction paradigm is a new conceptualization of computational phenomena that emphasizes interaction over algorithms, reflecting the shift from number-crunching on mainframes to distributed intelligent networks with graphical user interfaces. It challenges traditional answers to questions of problem solving and the scope of computation.
This book sets unites the various formalisms that define a programming language: ‘small steps’ operational semantics, ‘big steps’ operational semantics, and denotational semantics. It illustrates them with typical features of programming languages.
This volume refers to the formal description of mobility in computer science, using p-calculus, ambient calculus, bioambients, brane calculi, and systems of mobile membranes. Concepts are supported by examples and exercises, which makes it suitable for relevant courses.
This book details the results of several decades of research on developing, analyzing, and applying time models to computing and engineering. Each chapter is supplemented with detailed bibliographic remarks and exercises of varying difficulty and scope.
There has been much interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers and Knuth. This comprehensive reference volume collects the main results in the field.
This volume provides an introduction to the fundamental concepts of logic. Written for those new to the field, the text covers both elementary topics -- proofs, models, recursive functions, etc. -- as well as more advanced principles.
This textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. The book also presents a logical approach to engineering correct software.
This book presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs). It is an ideal resource for researchers in constraint programming and discrete optimisation.
The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. This guide, originating from a weblog written by the author, covers historical developments and latest approaches to the problem.