Domains and Lambda-Calculi by Pierrelouis Curien
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.-
The Optimal Implementation of Functional Programming Languages
-
Mathematics for Computer Graphics
-
The Clausal Theory of Types
-
Basic Proof Theory
-
Process Algebra
-
Nonmonotonic Reasoning
-
Applications of Process Algebra
- Reasoning about Gossip
-
Belief Revision
-
Mathematical Theory of Domains
-
Process Algebra: Equational Theories of Communicating Processes
-
Initial Algebras and Terminal Coalgebras
-
Rippling: Meta-Level Guidance for Mathematical Reasoning
-
Finite-State Techniques
-
Higher Order Logic and Hardware Verification
-
Formal Methods in Artificial Intelligence
-
Hybrid Graph Theory and Network Analysis
-
Data Refinement
-
Lambda-calculus, Combinators and Functional Programming
-
A Unifying Framework for Structured Analysis and Design Models
-
Concurrency Verification
-
Design Theory and Computer Science
-
Nets, Terms and Formulas
-
Computational Learning Theory
-
Metamathematics, Machines and Goedel's Proof
-
Formal Specification and Design
-
The Logic of Typed Feature Structures
-
Free Choice Petri Nets
-
Two-Level Functional Languages
-
Basic Simple Type Theory
-
Term Rewriting Systems
-
The Uncertain Reasoner's Companion
-
Deductive and Declarative Programming
-
Information Flow
-
Formal Semantics and Pragmatics for Natural Language Querying
Review of the hardback: '… extremely useful as a reference for classical results and techniques in general domain theory, very balanced in the treatment of mathematical properties of domains and their operational motivations and applications, and always deep in the choice of topics and in unravelling the connections between them' Felice Cardone, Science of Computer Programming
Review of the hardback: 'This is an excellent, thorough monograph … a rich and comprehensive source of information, it is very useful as a reference to classical results in domain theory and lambda calculus.' Paula G. Severi, Zentralblatt MATH
Review of the hardback: 'This is an excellent, thorough monograph … a rich and comprehensive source of information, it is very useful as a reference to classical results in domain theory and lambda calculus.' Paula G. Severi, Zentralblatt MATH
| SKU | Unavailable |
| ISBN 13 | 9780521622776 |
| ISBN 10 | 0521622778 |
| Title | Domains and Lambda-Calculi |
| Author | Pierrelouis Curien |
| Series | Cambridge Tracts In Theoretical Computer Science |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 1998-07-02 |
| Number of pages | 504 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |