 |
|
|
Item Details
| Title:
|
CATEGORICAL COMBINATORS, SEQUENTIAL ALGORITHMS AND FUNCTIONAL PROGRAMMING
|
| By: |
P-.L. Curien |
| Format: |
Hardback |
| List price:
|
£59.00 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3764336544 |
| ISBN 13: |
9783764336547 |
| Publisher: |
BIRKHAUSER VERLAG AG |
| Edition: |
2nd edition |
| Series: |
Progress in Theoretical Computer Science |
| Pages: |
420 |
| Description: |
This monograph is the second edition of a concrete approach to the semantics of sequential programming languages, which is a fundamental topic in theoretical computer science. It presents examples of fruitful interactions among computer science, category theory and mathematical logic. |
| Synopsis: |
This book is a thoroughly revised edition of a monograph that presents an approach to the design and implementation of sequential programming languages based on the relationship between lambda-calculus and category theory. The foundations of a new "categorical" combinatory logic are laid down. Compilation and evaluation techniques are investigated. A simple abstract machine, called the Categorical Abstract Machine, is presented: it has served as the core of the implementation of the language CAML, of the ML family, developed at INRIA-Roquencourt and Ecole Normale Superieure, and first released in 1987. The main characteristics of this approach are conceptual simplicity and compactness, with bearings on portability, efficiency, and correctness proofs. A mathematical semantics of sequentiality is proposed, in which "sequential algorithms" rather than functions are used to interpret procedures. The theoretical investigation has led to the development of a programming language, CDSO, in which basic and functional types are not differentiated. The evaluation framework is a demand-driven data flow network.The model of sequential algorithms is fully abstract with respect to this language: two procedures have the same denotation if and only if they have the same behaviour. Background on full abstraction is given. The new edition covers new results, and introduces new connections, as suggested by the following non-exhaustive fist of keywords: confluence properties of categorical combinators, explicit substitutions, control operations, linear logic, geometry of interaction, strong stability. |
| Illustrations: |
5 illustrations |
| Publication: |
Switzerland |
| Imprint: |
Birkhauser Verlag AG |
| Returns: |
Non-returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|