{"title":"Cambridge Tracts In Theoretical Computer Science","description":"\u003cp\u003eExplore the forefront of computer science with the Cambridge Tracts series. Dive into rigorous studies and theoretical explorations, perfect for researchers and advanced students seeking deep insights.\u003c\/p\u003e","products":[{"product_id":"applications-of-process-algebra-book-j-c-m-baeten-9780521607506","title":"Applications of Process Algebra","description":"This book gives applications of the theory of process algebra, or Algebra of Communicating Processes (ACP), that is the study of concurrent or communicating processes studied using an algebraic framework. The approach is axiomatic; the authors consider structures that are some set of mostly equational axioms, which are equipped with several operators. Thus the term 'algebra' is used in the model-theoretic sense. The axiomatic approach enables one to organize the field of process theories. The theory is applied systematically to a number of situations, including systolic algorithms, semantics of an object-oriented language, and protocols. It will be welcomed by computer scientists working in parallel programming.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49566694179089,"sku":"GOR013696956","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52337388060945,"sku":"NLS9780521607506","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521607507.jpg?v=1750880123"},{"product_id":"updating-logical-databases-book-marianne-winslett-9780521373715","title":"Updating Logical Databases","description":"This book tackles the problems of update algorithms for databases. How can one construct and maintain a database of facts, capable of incorporating new information and getting rid of all outdated information, and yet in the process not disturb any other information in the database? The author has produced a formal method for specifying the desired change intentionally, using a 'formula-based' approach to updating needs rather than a 'model-based' technique. The complexity of the algorithms, choice of semantics and a means of enforcing integrity constraints are also discussed. The book will be of value to all involved in database research.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49567769854225,"sku":"GOR009213102","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521373719.jpg?v=1750740815"},{"product_id":"understanding-z-book-j-m-spivey-9780521334297","title":"Understanding Z","description":"The Z notation is a language for expressing mathematical specifications of computing systems. By providing a formal semantics for Z, this book justifies the claim that Z is a precise specification language, and provides a standard framework for understanding Z specifications. Z is compared with other methods such as VDM and CLEAR, and in the final chapter, a number of studies in Z style are presented to show that Z can be used in a wide variety of specification tasks. This book will appeal to those who wish to deepen their understanding of the mathematical background of the Z method, those who want a concise definition of the language, and those interested in the design of specification languages.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49618240995601,"sku":"GOR005050283","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521334292.jpg?v=1750846351"},{"product_id":"nominal-sets-book-andrew-m-pitts-9781107017788","title":"Nominal Sets","description":"Nominal sets provide a promising new mathematical analysis of names in formal languages based upon symmetry, with many applications to the syntax and semantics of programming language constructs that involve binding, or localising names. Part I provides an introduction to the basic theory of nominal sets. In Part II, the author surveys some of the applications that have developed in programming language semantics (both operational and denotational), functional programming and logic programming. As the first book to give a detailed account of the theory of nominal sets, it will be welcomed by researchers and graduate students in theoretical computer science.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49759963087121,"sku":"GOR013778239","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52587871338769,"sku":"NLS9781107017788","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52746686398737,"sku":"NIN9781107017788","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1107017785.jpg?v=1751237647"},{"product_id":"epistemic-logic-for-ai-and-computer-science-book-j-j-ch-meyer-9780521602808","title":"Epistemic Logic for AI and Computer Science","description":"Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science as a means of reasoning about the knowledge and belief of agents. This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included together with their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the contexts of distributed systems and artificial intelligence: topics that are addressed include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The problem of logical omniscience is also discussed extensively. Halpern and Moses' theory of honest formulae is covered, and a digression is made into the realm of non-monotonic reasoning and preferential entailment. Moore's autoepistemic logic is discussed, together with Levesque's related logic of 'all I know'. Furthermore, it is shown how one can base default and counterfactual reasoning on epistemic logic.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49954972729617,"sku":"GOR007778592","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52143798550801,"sku":"NLS9780521602808","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521602807.jpg?v=1750814764"},{"product_id":"basic-simple-type-theory-book-j-roger-hindley-9780521054225","title":"Basic Simple Type Theory","description":"Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest  polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50353077092625,"sku":"CIN0521054222G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52408882594065,"sku":"NLS9780521054225","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52858224148753,"sku":"NIN9780521054225","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521054222.jpg?v=1751358729"},{"product_id":"nonmonotonic-reasoning-book-gerhard-brewka-9780521383943","title":"Nonmonotonic Reasoning","description":"In this 1991 book the author gives a broad overview of different areas of research in nonmonotonic reasoning, and presents some results and ideas based on his research. The guiding principles are: clarification of the different research activities in the area, which have sometimes been undertaken independently of each other, and appreciation of the fact that these research activities often represent different means to the same ends, namely sound theoretical foundations and efficient computation. The book begins with a discussion of the various types of nonmonotonic reasoning, their applications and their logics. Theorem proving techniques for these logics are also described. There then follow chapters dealing with formulations of nonmonotonic inheritance, and nonmonotonic reasoning based on nonmonotonic rules. The final chapter discusses the achievements in the field in the light of the famous Yale shooting example. The book will be welcomed by researchers in theoretical computer science and artificial intelligence.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50354331844881,"sku":"CIN0521383943G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":50785715224849,"sku":"GOR009203530","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51142975652113,"sku":"NIN9780521383943","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52428159942929,"sku":"NLS9780521383943","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521383943.jpg?v=1751229912"},{"product_id":"algorithmic-information-theory-book-gregory-j-chaitin-9780521616041","title":"Algorithmic Information Theory","description":"Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of G del's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50357344403729,"sku":"CIN0521616042G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52125222863121,"sku":"NLS9780521616041","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521616042.jpg?v=1750814774"},{"product_id":"understanding-z-book-j-m-spivey-9780521054140","title":"Understanding Z","description":"The Z notation is a language for expressing mathematical specifications of computing systems. By providing a formal semantics for Z, this book justifies the claim that Z is a precise specification language, and provides a standard framework for understanding Z specifications. Z is compared with other methods such as VDM and CLEAR, and in the final chapter, a number of studies in Z style are presented to show that Z can be used in a wide variety of specification tasks. This book will appeal to those who wish to deepen their understanding of the mathematical background of the Z method, those who want a concise definition of the language, and those interested in the design of specification languages.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":50407729496337,"sku":"GOR013938087","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52407835263249,"sku":"NLS9780521054140","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521054141.jpg?v=1750741771"},{"product_id":"optimal-implementation-of-functional-programming-languages-book-stefano-guerrini-9780521621120","title":"The Optimal Implementation of Functional Programming Languages","description":"All traditional implementation techniques for functional languages fail to avoid useless repetition of work. They are not optimal in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This work, the first on the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of L vy and to Girard's more recent Geometry of Interaction are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic.","brand":"WoB","offers":[{"title":"US \/ WELL_READ \/ SBYB","offer_id":50468650221841,"sku":"CIN0521621127A","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ GOOD \/ SBYB","offer_id":50468652024081,"sku":"CIN0521621127G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":50963607945489,"sku":"CIN0521621127VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ NEW \/ INGRAM","offer_id":51003177173265,"sku":"NIN9780521621120","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52139808162065,"sku":"NLS9780521621120","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521621127.jpg?v=1751167469"},{"product_id":"derivation-and-computation-book-h-simmons-9780521771733","title":"Derivation and Computation","description":"Mathematics is about proofs, that is the derivation of correct statements; and calculations, that is the production of results according to well-defined sets of rules. The two notions are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. The aim of the author is to explore this relationship. The book itself forms an introduction to simple type theory. Starting from the familiar propositional calculus the author develops the central idea of an applied lambda-calculus. This is illustrated by an account of Gödel's T, a system which codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. These are designed to help the reader get to grips with the subject, and develop a further understanding. An appendix contains complete solutions of these exercises.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50577853317393,"sku":"CIN0521771730G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ GARDNERS","offer_id":50697192866065,"sku":"NGR9780521771733","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52673934786833,"sku":"NLS9780521771733","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735458869521,"sku":"NIN9780521771733","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521771730.jpg?v=1750782520"},{"product_id":"information-flow-book-jon-barwise-9780521070997","title":"Information Flow","description":"Information is a central topic in computer science, cognitive science and philosophy. In spite of its importance in the 'information age', there is no consensus on what information is, what makes it possible, and what it means for one medium to carry information about another. Drawing on ideas from mathematics, computer science and philosophy, this book addresses the definition and place of information in society. The authors, observing that information flow is possible only within a connected distribution system, provide a mathematically rigorous, philosophically sound foundation for a science of information. They illustrate their theory by applying it to a wide range of phenomena, from file transfer to DNA, from quantum mechanics to speech act theory.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":50697195684113,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ GARDNERS","offer_id":50697197912337,"sku":"NGR9780521070997","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52130841329937,"sku":"NLS9780521070997","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735515787537,"sku":"NIN9780521070997","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521070996.jpg?v=1751293519"},{"product_id":"process-algebra-book-j-c-m-baeten-amsterdam-9780521400435","title":"Process Algebra","description":"This is an introduction to process algebra, also known as the Algebra of Communicating Processes (ACP). It is a self-contained mathematical approach to the theory which can be used for graduate courses, though it also has material of interest to researchers. It is a unique introduction to this model of concurrent programming and will be essential reading for all computer scientists interested in parallel processing and algebraic methods in computer science.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":50767821111569,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":50767821963537,"sku":"GOR014064272","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521400430.jpg?v=1751359021"},{"product_id":"modal-logic-book-patrick-blackburn-9780521527149","title":"Modal Logic","description":"This is an advanced 2001 textbook on modal logic, a field which caught the attention of computer scientists in the late 1970s. Researchers in areas ranging from economics to computational linguistics have since realised its worth. The book is for novices and for more experienced readers, with two distinct tracks clearly signposted at the start of each chapter. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects, and applications to issues in logic and computer science such as completeness, computability and complexity are considered. Three appendices supply basic background information and numerous exercises are provided. Ideal for anyone wanting to learn modern modal logic.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51003144831249,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51003148140817,"sku":"NIN9780521527149","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":51696966304017,"sku":"CIN0521527147VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52462611628305,"sku":"NLS9780521527149","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521527147.jpg?v=1751072723"},{"product_id":"topology-via-logic-book-steven-vickers-9780521576512","title":"Topology via Logic","description":"Now in paperback, Topology via Logic is an advanced textbook on topology for computer scientists. Based on a course given by the author to postgraduate students of computer science at Imperial College, it has three unusual features. First, the introduction is from the locale viewpoint, motivated by the logic of finite observations: this provides a more direct approach than the traditional one based on abstracting properties of open sets in the real line. Second, the methods of locale theory are freely exploited. Third, there is substantial discussion of some computer science applications. Although books on topology aimed at mathematics exist, no book has been written specifically for computer scientists. As computer scientists become more aware of the mathematical foundations of their discipline, it is appropriate that such topics are presented in a form of direct relevance and applicability. This book goes some way towards bridging the gap.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51003160396049,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51003163640081,"sku":"NIN9780521576512","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ GOOD \/ INTERNAL","offer_id":51564181192977,"sku":"GOR014329519","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":51565505675537,"sku":"GOR006365008","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52123081474321,"sku":"NLS9780521576512","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ GOOD \/ SBYB","offer_id":53397847277841,"sku":"CIN0521576512G","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521576512.jpg?v=1750697957"},{"product_id":"basic-proof-theory-book-a-s-troelstra-9780521779111","title":"Basic Proof Theory","description":"This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51003206631697,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51003210039569,"sku":"NIN9780521779111","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":51575705862417,"sku":"CIN0521779111VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52128185319697,"sku":"NLS9780521779111","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":52492323258641,"sku":"GOR012195966","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ GARDNERS","offer_id":53005944881425,"sku":"NGR9780521779111","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521779111.jpg?v=1750741175"},{"product_id":"topological-duality-for-distributive-lattices-book-mai-gehrke-9781009349697","title":"Topological Duality for Distributive Lattices","description":"Introducing Stone–Priestley duality theory and its applications to logic and theoretical computer science, this book equips graduate students and researchers with the theoretical background necessary for reading and understanding current research in the area. After giving a thorough introduction to the algebraic, topological, logical, and categorical aspects of the theory, the book covers two advanced applications in computer science, namely in domain theory and automata theory. These topics are at the forefront of active research seeking to unify semantic methods with more algorithmic topics in finite model theory. Frequent exercises punctuate the text, with hints and references provided.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51012415127825,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51012417323281,"sku":"NIN9781009349697","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52587245863185,"sku":"NLS9781009349697","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1009349694.jpg?v=1750706585"},{"product_id":"advanced-topics-in-bisimulation-and-coinduction-book-davide-sangiorgi-9781107004979","title":"Advanced Topics in Bisimulation and Coinduction","description":"Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51019638079761,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51019640439057,"sku":"NIN9781107004979","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52408417812753,"sku":"NLS9781107004979","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1107004977.jpg?v=1750919305"},{"product_id":"introduction-to-coalgebra-book-bart-jacobs-9781107177895","title":"Introduction to Coalgebra","description":"The area of coalgebra has emerged within theoretical computer science with a unifying claim: to be the mathematics of computational dynamics. It combines ideas from the theory of dynamical systems and from the theory of state-based computation. Although still in its infancy, it is an active area of research that generates wide interest. Written by one of the founders of the field, this book acts as the first mature and accessible introduction to coalgebra. It provides clear mathematical explanations, with many examples and exercises involving deterministic and non-deterministic automata, transition systems, streams, Markov chains and weighted automata. The theory is expressed in the language of category theory, which provides the right abstraction to make the similarity and duality between algebra and coalgebra explicit, and which the reader is introduced to in a hands-on manner. The book will be useful to mathematicians and (theoretical) computer scientists and will also be of interest to mathematical physicists, biologists and economists.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51019814240529,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51019816829201,"sku":"NIN9781107177895","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52429530071313,"sku":"NLS9781107177895","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1107177898.jpg?v=1751080973"},{"product_id":"nonmonotonic-reasoning-book-gerhard-brewka-9780521181303","title":"Nonmonotonic Reasoning","description":"In this 1991 book the author gives a broad overview of different areas of research in nonmonotonic reasoning, and presents some results and ideas based on his research. The guiding principles are: clarification of the different research activities in the area, which have sometimes been undertaken independently of each other, and appreciation of the fact that these research activities often represent different means to the same ends, namely sound theoretical foundations and efficient computation. The book begins with a discussion of the various types of nonmonotonic reasoning, their applications and their logics. Theorem proving techniques for these logics are also described. There then follow chapters dealing with formulations of nonmonotonic inheritance, and nonmonotonic reasoning based on nonmonotonic rules. The final chapter discusses the achievements in the field in the light of the famous Yale shooting example. The book will be welcomed by researchers in theoretical computer science and artificial intelligence.","brand":"WoB","offers":[{"title":"US \/ NEW \/ INGRAM","offer_id":51105034305809,"sku":"NIN9780521181303","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52400892313873,"sku":"NLS9780521181303","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521181305.jpg?v=1751007785"},{"product_id":"algebraic-specification-of-communication-protocols-book-s-mauw-9780521088121","title":"Algebraic Specification of Communication Protocols","description":"Modern computer networks now circle the world, but the transmission of information between them depends on the many different protocols that define the behaviour of the sender and receiver. It is clear therefore, that the accurate description of these protocols is important if harmonious communication is to be maintained. In this book the authors use the formal specification language PSF to provide an unambiguous description of several communication protocols of varying levels of complexity, ranging from the alternating bit protocol to the token ring protocol. Beginners, as well as professionals in the field of communication protocols, will benefit from both the methods of specification described and the protocols discussed in this book.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51113732768017,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51113733914897,"sku":"NIN9780521088121","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52135159431441,"sku":"NLS9780521088121","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521088127.jpg?v=1751197458"},{"product_id":"domains-and-lambda-calculi-book-pierrelouis-curien-9780521062923","title":"Domains and Lambda-Calculi","description":"This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51222733259025,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51222733652241,"sku":"NIN9780521062923","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52089477890321,"sku":"NLS9780521062923","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521062926.jpg?v=1751007661"},{"product_id":"extensions-of-first-order-logic-book-maria-manzano-9780521019026","title":"Extensions of First-Order Logic","description":"Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics. This is an introduction to extensions of first-order logic, based on the principle that many-sorted logic (MSL) provides a unifying framework in which to place, for example, second-order logic, type theory, modal and dynamic logics and MSL itself. The aim is two fold: only one theorem-prover is needed; proofs of the metaproperties of the different existing calculi can be avoided by borrowing them from MSL. To make the book accessible to readers from different disciplines, whilst maintaining precision, the author has supplied detailed step-by-step proofs, avoiding difficult arguments, and continually motivating the material with examples. Consequently this can be used as a reference, for self-teaching or for first-year graduate courses.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51304623669521,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51304626094353,"sku":"NIN9780521019026","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52331495325969,"sku":"NLS9780521019026","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521019028.jpg?v=1750697999"},{"product_id":"programs-recursion-and-unbounded-choice-book-wim-h-hesselink-9780521018296","title":"Programs, Recursion and Unbounded Choice","description":"This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs.","brand":"WoB","offers":[{"title":"US \/ NEW \/ INGRAM","offer_id":51304625963281,"sku":"NIN9780521018296","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52331515216145,"sku":"NLS9780521018296","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521018293.jpg?v=1751040227"},{"product_id":"algorithmic-information-theory-book-gregory-j-chaitin-9780521343060","title":"Algorithmic Information Theory","description":"Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of G del's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51462922207505,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":51462922469649,"sku":"GOR008433513","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ GOOD \/ SBYB","offer_id":52988439003409,"sku":"CIN0521343062G","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521343062.jpg?v=1750814557"},{"product_id":"proofs-and-types-book-jean-yves-girard-9780521371810","title":"Proofs and Types","description":"This book is derived from notes prepared by J-Y.Girard for a course at the University of Paris VII. It deals with the mathematical background of the application to computer science of aspects of logic. It sheds light on traditional logic material and its prospective application to computer science.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51541436268817,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ GOOD \/ INTERNAL","offer_id":51541436498193,"sku":"GOR002226420","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521371813.jpg?v=1750879929"},{"product_id":"clausal-theory-of-types-book-d-a-wolfram-9780521395380","title":"The Clausal Theory of Types","description":"In this book is presented the theoretical foundation of a higher-order logic programming language with equality, based on the clausal theory of types.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51592452604177,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":51592452636945,"sku":"GOR014340193","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52428280037649,"sku":"NLS9780521395380","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521395380.jpg?v=1751420695"},{"product_id":"syntax-and-semantics-of-petri-nets-book-roberto-gorrieri-9781009613286","title":"Syntax and Semantics of Petri Nets","description":"Petri nets are one of the most popular tools for modeling distributed systems. This book provides a modern look at the theory behind them, by studying three classes of nets that model (i) sequential systems, (ii) non-communicating parallel systems, and (iii) communicating parallel systems. A decidable and causality respecting behavioral equivalence is presented for each class, followed by a modal logic characterization for each equivalence. The author then introduces a suitable process algebra for the corresponding class of nets and proves that the behavioral equivalence proposed for each class is a congruence for the operator of the corresponding process algebra. Finally, an axiomatization of the behavioral congruence is proposed. The theory is introduced step by step, with ordinary-language explanations and examples provided throughout, to remain accessible to readers without specialized training in concurrency theory or formal logic. Exercises with solutions solidify understanding, and the final chapter hints at extensions of the theory.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51599256846609,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ GARDNERS","offer_id":51599256977681,"sku":"NGR9781009613286","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52516781719825,"sku":"NLS9781009613286","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52725046444305,"sku":"NIN9781009613286","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1009613286.jpg?v=1751364868"},{"product_id":"logic-and-computation-book-lawrence-c-paulson-9780521346320","title":"Logic and Computation","description":"This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program statements. Cambridge LCF is based on an earlier theorem-proving system, Edinburgh LCF, which introduced a design that gives the user flexibility to use and extend the system. A goal of this book is to explain the design, which has been adopted in several other systems. The book consists of two parts. Part I outlines the mathematical preliminaries, elementary logic and domain theory, and explains them at an intuitive level, giving reference to more advanced reading; Part II provides sufficient detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51835379155217,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":51835379253521,"sku":"GOR008020083","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521346320.jpg?v=1753089129"},{"product_id":"mathematics-for-computer-graphics-book-s-g-hoggar-9780521375740","title":"Mathematics for Computer Graphics","description":"This unique textbook, which is based on courses taught by the author to students in the US, UK and Europe, introduces the geometry, analysis and topology necessary to understand the mathematical framework for computer graphics. The topics covered range from symmetry and tilings to chaos and fractals, and the applications from computational geometry through numerical analysis to geometric modelling. Consequently it will be welcomed by mathematicians, computer scientists and engineers, whether students or professionals.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":52101709234449,"sku":"GOR003885923","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521375740.jpg?v=1757094252"},{"product_id":"logic-and-computation-book-lawrence-c-paulson-9780521395601","title":"Logic and Computation","description":"This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program statements. Cambridge LCF is based on an earlier theorem-proving system, Edinburgh LCF, which introduced a design that gives the user flexibility to use and extend the system. A goal of this book is to explain the design, which has been adopted in several other systems. The book consists of two parts. Part I outlines the mathematical preliminaries, elementary logic and domain theory, and explains them at an intuitive level, giving reference to more advanced reading; Part II provides sufficient detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52123505525009,"sku":"NLS9780521395601","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":53492563476753,"sku":"NIN9780521395601","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521395601.jpg?v=1757450525"},{"product_id":"updating-logical-databases-book-marianne-winslett-9780521619721","title":"Updating Logical Databases","description":"This book tackles the problems of update algorithms for databases. How can one construct and maintain a database of facts, capable of incorporating new information and getting rid of all outdated information, and yet in the process not disturb any other information in the database? The author has produced a formal method for specifying the desired change intentionally, using a 'formula-based' approach to updating needs rather than a 'model-based' technique. The complexity of the algorithms, choice of semantics and a means of enforcing integrity constraints are also discussed. The book will be of value to all involved in database research.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52123997110545,"sku":"NLS9780521619721","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521619721.jpg?v=1757454671"},{"product_id":"predicate-transformer-semantics-book-ernest-g-manes-9780521616102","title":"Predicate Transformer Semantics","description":"A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students and researchers in theoretical computer science.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52125639475473,"sku":"NLS9780521616102","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521616102.jpg?v=1757467267"},{"product_id":"theoretical-foundations-of-vlsi-design-book-k-mcevoy-9780521545655","title":"Theoretical Foundations of VLSI Design","description":"This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and organised by the editors.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52134598148369,"sku":"NLS9780521545655","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521545655.jpg?v=1757543855"},{"product_id":"action-semantics-book-peter-d-mosses-9780521619332","title":"Action Semantics","description":"Action Semantics is a novel approach to the formal description of programming languages. Its abstractness is at an intermediate level, between that of denotational and operational semantics. Action Semantics has considerable pragmatic advantages over all previous approaches, in its comprehensibility and accessibility, and especially in the usefulness of its semantic descriptions of realistic programming languages. In this volume, Dr Peter Mosses gives a thorough introduction to action semantics, and provides substantial illustrations of its use. Graduates of computer science or maths who have an interest in the semantics of programming languages will find Action Semantics a most helpful book.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52135268253969,"sku":"NLS9780521619332","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521619332.jpg?v=1757548160"},{"product_id":"concurrency-verification-book-jozef-hooman-9780521806084","title":"Concurrency Verification","description":"This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52135325303057,"sku":"NLS9780521806084","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521806084.jpg?v=1757548459"},{"product_id":"belief-revision-book-peter-grdenfors-9780521545648","title":"Belief Revision","description":"Belief revision is a topic of much interest in theoretical computer science and logic, and it forms a central problem in research into artificial intelligence. In simple terms: how do you update a database of knowledge in the light of new information? What if the new information is in conflict with something that was previously held to be true? An intelligent system should be able to accommodate all such cases. This book contains a collection of research articles on belief revision that are completely up to date and an introductory chapter that presents a survey of current research in the area and the fundamentals of the theory. Thus this volume will be useful as a textbook on belief revision.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52135651377425,"sku":"NLS9780521545648","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735556649233,"sku":"NIN9780521545648","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521545648.jpg?v=1757550182"},{"product_id":"two-level-functional-languages-book-flemming-nielson-9780521403849","title":"Two-Level Functional Languages","description":"The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus, in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of 'parametrized semantics' is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose; it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalises Wadler's analysis for lists.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52137928458513,"sku":"NLS9780521403849","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521403849.jpg?v=1757559917"},{"product_id":"formal-semantics-and-pragmatics-for-natural-language-querying-book-james-clifford-9780521602747","title":"Formal Semantics and Pragmatics for Natural Language Querying","description":"This book discusses the connection between two areas of semantics, namely the semantics of databases and the semantics of natural language, and links them via a common view of the semantics of time. It is argued that a coherent theory of the semantics of time is an essential ingredient for the success of efforts to incorporate more 'real world' semantics into database models. This idea is a relatively recent concern of database research but it is receiving growing interest. The book begins with a discussion of database querying which motivates the use of the paradigm of Montague Semantics and discusses the details of the intensional logic ILs. This is followed by a description of the author's own model, the Historical Relational Data Model (HRDM) which extends the RDM to include a temporal dimension. Finally the database querying language QEHIII is defined and examples illustrate its use. A formal model for the interpretation of questions is presented in this work which will form the basis for much further research.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52144673620241,"sku":"NLS9780521602747","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521602747.jpg?v=1757590040"},{"product_id":"domains-and-lambda-calculi-book-pierrelouis-curien-9780521622776","title":"Domains and Lambda-Calculi","description":"This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52146571477265,"sku":"NLS9780521622776","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521622776.jpg?v=1757598016"},{"product_id":"information-flow-book-jon-barwise-9780521583862","title":"Information Flow","description":"Information is a central topic in computer science, cognitive science and philosophy. In spite of its importance in the 'information age', there is no consensus on what information is, what makes it possible, and what it means for one medium to carry information about another. Drawing on ideas from mathematics, computer science and philosophy, this book addresses the definition and place of information in society. The authors, observing that information flow is possible only within a connected distribution system, provide a mathematically rigorous, philosophically sound foundation for a science of information. They illustrate their theory by applying it to a wide range of phenomena, from file transfer to DNA, from quantum mechanics to speech act theory.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52147298468113,"sku":"NLS9780521583862","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735576047889,"sku":"NIN9780521583862","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":53154632565009,"sku":"GOR010080032","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521583862.jpg?v=1757600077"},{"product_id":"deductive-and-declarative-programming-book-peter-padawitz-9780521032513","title":"Deductive and Declarative Programming","description":"Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52147379077393,"sku":"NLS9780521032513","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521032513.jpg?v=1757600330"},{"product_id":"uncertain-reasoner-s-companion-book-j-b-paris-9780521032728","title":"The Uncertain Reasoner's Companion","description":"Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise self-contained, collecting together the key results on the subject and formalizing within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences of the main theories about uncertain reasoning, so the book can serve as a textbook for beginners or as a starting point for further basic research into the subject. It will be welcomed by graduate students and research workers in logic, philosophy and computer science as an account of how mathematics and artificial intelligence can complement and enrich each other.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52148493484305,"sku":"NLS9780521032728","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735505006865,"sku":"NIN9780521032728","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521032728.jpg?v=1757603754"},{"product_id":"term-rewriting-systems-book-terese-9780521391153","title":"Term Rewriting Systems","description":"Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52149009449233,"sku":"NLS9780521391153","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521391153.jpg?v=1757605397"},{"product_id":"unifying-framework-for-structured-analysis-and-design-models-book-t-h-tse-9780521391962","title":"A Unifying Framework for Structured Analysis and Design Models","description":"Structured methodologies are a popular and powerful tool in information systems development. Many different ones exist, each employing a number of models and so a specification must be converted from one form to another during the development process. To solve this problem, Dr Tse proposes in this 1991 book a unifying framework behind popular structured models. He approaches the problem from the viewpoints of algebra and category theory. He not only develops the frameworks but also illustrates their practical and theoretical usefulness. Thus this book will provide insight for software engineers into how methodologies can be formalised and will open up a range of applications and problems for theoretical computer scientists.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52149998027025,"sku":"NLS9780521391962","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52735543836945,"sku":"NIN9780521391962","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521391962.jpg?v=1757608626"},{"product_id":"basic-simple-type-theory-book-j-roger-hindley-9780521465182","title":"Basic Simple Type Theory","description":"Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest  polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52152070177041,"sku":"NLS9780521465182","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521465182.jpg?v=1757615452"},{"product_id":"two-level-functional-languages-book-flemming-nielson-9780521018470","title":"Two-Level Functional Languages","description":"The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus, in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of 'parametrized semantics' is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose; it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalises Wadler's analysis for lists.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52332336578833,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52332336906513,"sku":"NLS9780521018470","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521018470.jpg?v=1758151303"},{"product_id":"nets-terms-and-formulas-book-e-olderog-9780521018456","title":"Nets, Terms and Formulas","description":"The author presents a theory of concurrent processes where three different semantic description methods that are usually studied in isolation are brought together. Petri nets describe processes as concurrent and interacting machines; algebraic process terms describe processes as abstract concurrent processes; and logical formulas specify the intended communication behaviour of processes. At the heart of this theory are two sets of transformation rules for the top-down design of concurrent processes. The first set can be used to transform stepwise logical formulas into process terms, whilst process terms can be transformed into Petri nets by the second set. These rules are based on novel techniques for the operational and denotational semantics of concurrent processes. Various results and relationships between nets, terms and formulas starting with formulas and illustrated by examples. The use of transformations is demonstrated in a series of case studies, and the author also identifies directions for research.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52332356370705,"sku":"NLS9780521018456","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521018456.jpg?v=1758151367"},{"product_id":"free-choice-petri-nets-book-javier-esparza-9780521019453","title":"Free Choice Petri Nets","description":"Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52332534694161,"sku":"NLS9780521019453","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":53528449843473,"sku":"GOR014955710","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521019453.jpg?v=1758151953"},{"product_id":"logic-of-typed-feature-structures-book-robert-l-carpenter-9780521022545","title":"The Logic of Typed Feature Structures","description":"This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems. A logical perspective is adopted which employs an attribute-value description language along with complete equational axiomatizations of the various systems of feature structures. At the same time, efficiency concerns are kept in mind and complexity and representability results are provided. The application of feature structures to phrase structure grammars is described and completeness results are shown for standard evaluation strategies. Definite clause logic programs are treated as a special case of phrase structure grammars. Constraint systems are introduced and an enumeration technique is developed for solving arbitrary attribute-value logic constraints. This book, with its innovative approach to data structure, will be essential reading for researchers in computational linguistics, logic programming and knowledge representation. Its self-contained presentation makes it flexible enough to serve as both a research tool and a text book.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52335620063505,"sku":"NLS9780521022545","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521022545.jpg?v=1758160590"}],"url":"https:\/\/www.worldofbooks.com\/de-ch\/collections\/cambridge-tracts-in-theoretical-computer-science-buchreihe.oembed?page=5","provider":"World of Books ","version":"1.0","type":"link"}