Cambridge Tracts in Theoretical Computer Science – serie
Visar alla böcker i serien Cambridge Tracts in Theoretical Computer Science. Handla med fri frakt och snabb leverans.
67 produkter
Programs, Recursion and Unbounded Choice
Av Wim H. Hesselink, C. J. van Rijsbergen
Häftad, 2005
804 kr
Lägg i varukorg
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 …
Nets, Terms and Formulas
Three Views of Concurrent Processes and their Relationship
Av E. -R. Olderog, C. J. Van Rijsbergen m. fl.
Häftad, 2005
804 kr
Lägg i varukorg
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 …
Two-Level Functional Languages
Av Flemming Nielson, Hanne Riis Nielson m. fl.
Häftad, 2005
885 kr
Lägg i varukorg
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. …
Extensions of First-Order Logic
Av Maria Manzano, C. J. Van Rijsbergen m. fl.
Häftad, 2005
1188 kr
Lägg i varukorg
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 …
Free Choice Petri Nets
Av Jorg Desel, Javier Esparza m. fl.
Häftad, 2005
716 kr
Lägg i varukorg
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 …
The Logic of Typed Feature Structures
With Applications to Unification Grammars, Logic Programs and Constraint Resolution
Av Robert L. Carpenter, C. J. Van Rijsbergen m. fl.
Häftad, 2005
804 kr
Lägg i varukorg
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 …
Deductive and Declarative Programming
Av Peter Padawitz, C. J. van Rijsbergen
Häftad, 2006
804 kr
Lägg i varukorg
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, …
The Uncertain Reasoner's Companion
A Mathematical Perspective
Av J. B. Paris, C. J. Van Rijsbergen m. fl.
Häftad, 2006
838 kr
Lägg i varukorg
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 …
Understanding Z
A Specification Language and its Formal Semantics
Av J. M. Spivey
Häftad, 2008
639 kr
Lägg i varukorg
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 …
Basic Simple Type Theory
Häftad, 2008
667 kr
Lägg i varukorg
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 …
Domains and Lambda-Calculi
Av Roberto M. Amadio, Pierre-Louis Curien
Häftad, 2008
976 kr
Lägg i varukorg
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 …
Mathematical Theory of Domains
Av V. Stoltenberg-Hansen, I. Lindström m. fl.
Häftad, 2008
927 kr
Lägg i varukorg
Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the …
Information Flow
The Logic of Distributed Systems
Av Jon Barwise, Jerry Seligman
Häftad, 2008
976 kr
Lägg i varukorg
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 …
Algebraic Specification of Communication Protocols
Av S. Mauw, G. J. Veltink
Häftad, 2008
770 kr
Lägg i varukorg
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 …
Data Refinement
Model-Oriented Proof Methods and their Comparison
Av Willem-Paul de Roever, Kai Engelhardt
Häftad, 2008
972 kr
Lägg i varukorg
The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data …
Hybrid Graph Theory and Network Analysis
Av Ladislav Novak, Alan Gibbons
Häftad, 2009
667 kr
Lägg i varukorg
First published in 1999, this book combines traditional graph theory with the matroidal view of graphs and throws light on mathematical aspects of network analysis. This approach is called here hybrid graph theory. This is essentially a vertex-independent view of graphs naturally leading into the …
Lambda-calculus, Combinators and Functional Programming
Av G. E. Revesz
Häftad, 2009
938 kr
Lägg i varukorg
Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. …
Higher Order Logic and Hardware Verification
Av T. F. Melham
Häftad, 2009
653 kr
Lägg i varukorg
This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms …
A Unifying Framework for Structured Analysis and Design Models
An Approach Using Initial Algebra Semantics and Category Theory
Av T. H. Tse
Häftad, 2009
687 kr
Lägg i varukorg
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 …
The Clausal Theory of Types
Häftad, 2009
502 kr
Lägg i varukorg
Logic programming was based on first-order logic. Higher-order logics can also lead to theories of theorem-proving. This book introduces just such a theory, based on a lambda-calculus formulation of a clausal logic with equality, known as the Clausal Theory of Types. By restricting this logic to …
Design Theory and Computer Science
Häftad, 2009
1190 kr
Lägg i varukorg
The logic and methodology of design is examined in this book from the perspective of computer science. Computers provide the context for this examination both by discussion of the design process for hardware and software systems and by consideration of the role of computers in design in general. …
Concurrency Verification
Introduction to Compositional and Non-compositional Methods
Av Willem-Paul de Roever, Frank de Boer m. fl.
Häftad, 2012
1341 kr
Lägg i varukorg
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 …
Nonmonotonic Reasoning
Logical Foundations of Commonsense
Häftad, 2012
737 kr
Lägg i varukorg
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 …
Nonmonotonic Reasoning
Logical Foundations of Commonsense
Inbunden, 1991
1207 kr
Lägg i varukorg
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 …
Design Theory and Computer Science
Inbunden, 1991
2700 kr
Lägg i varukorg
The logic and methodology of design is examined in this book from the perspective of computer science. Computers provide the context for this examination both by discussion of the design process for hardware and software systems and by consideration of the role of computers in design in general. …
Term Rewriting Systems
Av Terese
Inbunden, 2003
3590 kr
Lägg i varukorg
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 …
A Unifying Framework for Structured Analysis and Design Models
An Approach Using Initial Algebra Semantics and Category Theory
Av T. H. Tse
Inbunden, 1991
1962 kr
Lägg i varukorg
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 …
The Clausal Theory of Types
Inbunden, 1993
1089 kr
Lägg i varukorg
Logic programming was based on first-order logic. Higher-order logics can also lead to theories of theorem-proving. This book introduces just such a theory, based on a lambda-calculus formulation of a clausal logic with equality, known as the Clausal Theory of Types. By restricting this logic to …
Logic and Computation
Interactive Proof with Cambridge LCF
Av Lawrence C. Paulson, C. J. Van Rijsbergen m. fl.
Häftad, 1990
911 kr
Lägg i varukorg
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 …
Nets, Terms and Formulas
Three Views of Concurrent Processes and their Relationship
Inbunden, 1991
1626 kr
Lägg i varukorg
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 …
