Author:
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 226
Book Description
Tracts for Computers
Design Theory and Computer Science
Author: Subrata Dasgupta
Publisher: Cambridge University Press
ISBN: 0521390214
Category : Computers
Languages : en
Pages : 450
Book Description
The author examines logic and methodology of design 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. The central question posed by the author is whether or not we can construct a theory of design.
Publisher: Cambridge University Press
ISBN: 0521390214
Category : Computers
Languages : en
Pages : 450
Book Description
The author examines logic and methodology of design 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. The central question posed by the author is whether or not we can construct a theory of design.
Term Rewriting Systems
Author: Terese
Publisher: Cambridge University Press
ISBN: 9780521391153
Category : Computers
Languages : en
Pages : 926
Book 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.
Publisher: Cambridge University Press
ISBN: 9780521391153
Category : Computers
Languages : en
Pages : 926
Book 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.
Free Choice Petri Nets
Author: Jorg Desel
Publisher: Cambridge University Press
ISBN: 9780521465199
Category : Computers
Languages : en
Pages : 256
Book Description
Petri nets are a model for the analysis of concurrent systems.
Publisher: Cambridge University Press
ISBN: 9780521465199
Category : Computers
Languages : en
Pages : 256
Book Description
Petri nets are a model for the analysis of concurrent systems.
Nominal Sets
Author: Andrew M. Pitts
Publisher: Cambridge University Press
ISBN: 1107244684
Category : Computers
Languages : en
Pages : 291
Book 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.
Publisher: Cambridge University Press
ISBN: 1107244684
Category : Computers
Languages : en
Pages : 291
Book 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.
Modal Logic
Author: Patrick Blackburn
Publisher: Cambridge University Press
ISBN: 1316101959
Category : Computers
Languages : en
Pages : 574
Book 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.
Publisher: Cambridge University Press
ISBN: 1316101959
Category : Computers
Languages : en
Pages : 574
Book 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.
Advanced Topics in Bisimulation and Coinduction
Author: Davide Sangiorgi
Publisher: Cambridge University Press
ISBN: 1139502905
Category : Computers
Languages : en
Pages : 341
Book 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.
Publisher: Cambridge University Press
ISBN: 1139502905
Category : Computers
Languages : en
Pages : 341
Book 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.
Domains and Lambda-Calculi
Author: Roberto M. Amadio
Publisher: Cambridge University Press
ISBN: 0521622778
Category : Computers
Languages : en
Pages : 504
Book Description
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Publisher: Cambridge University Press
ISBN: 0521622778
Category : Computers
Languages : en
Pages : 504
Book Description
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Process Algebra: Equational Theories of Communicating Processes
Author: J. C. M. Baeten
Publisher: Cambridge University Press
ISBN: 0521820499
Category : Computers
Languages : en
Pages : 477
Book Description
Presents a unified overview of the various process algebras currently in use and sets the standard for the field.
Publisher: Cambridge University Press
ISBN: 0521820499
Category : Computers
Languages : en
Pages : 477
Book Description
Presents a unified overview of the various process algebras currently in use and sets the standard for the field.