Fr. 69.00

Category Theory and Computer Programming - Tutorial and Workshop, Guildford, U.K., September 16 - 20, 1985. Proceedings

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more










Categories.- Elements of categorical reasoning : Products and coproducts and some other (co-)limits.- Functors and natural transformations.- Adjunctions.- Cartesian closure ¿ Higher types in categories.- Algebra categorically.- Category theory and logic.- Categories, data types, and imperative languages.- Category theory and programming language semantics: An overview.- Weakest preconditions: Categorical insights.- A categorical view of weakest liberal preconditions.- Functor-category semantics of programming languages and logics.- Finite approximation of spaces.- Categories of partial morphisms and the ?P-calculus.- A note on distributive laws and power domains.- Category theory and models for parallel computation.- Categorical models of process cooperation.- Galois connections and computer science applications.- A study in the foundations of programming methodology: Specifications, institutions, charters and parchments.- Bits and pieces of the theory of institutions.- Extended ML: An institution-independent framework for formal program development.- Behavioural program specification.- Key extensions of abstract data types, final algebras, and database semantics.- Theories as categories.- Internal completeness of categories of domains.- Formalising the network and hierarchical data models ¿ an application of categorical Logic.- A categorical unification algorithm.- Computing with categories.

List of contents

Categories.- Elements of categorical reasoning : Products and coproducts and some other (co-)limits.- Functors and natural transformations.- Adjunctions.- Cartesian closure - Higher types in categories.- Algebra categorically.- Category theory and logic.- Categories, data types, and imperative languages.- Category theory and programming language semantics: An overview.- Weakest preconditions: Categorical insights.- A categorical view of weakest liberal preconditions.- Functor-category semantics of programming languages and logics.- Finite approximation of spaces.- Categories of partial morphisms and the ?P-calculus.- A note on distributive laws and power domains.- Category theory and models for parallel computation.- Categorical models of process cooperation.- Galois connections and computer science applications.- A study in the foundations of programming methodology: Specifications, institutions, charters and parchments.- Bits and pieces of the theory of institutions.- Extended ML: An institution-independent framework for formal program development.- Behavioural program specification.- Key extensions of abstract data types, final algebras, and database semantics.- Theories as categories.- Internal completeness of categories of domains.- Formalising the network and hierarchical data models - an application of categorical Logic.- A categorical unification algorithm.- Computing with categories.

Product details

Assisted by Samso Abramsky (Editor), Samson Abramsky (Editor), David Pitt (Editor), Axel Poigne (Editor), Axel Poigne et al (Editor), David Rydeheard (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 26.06.2009
 
EAN 9783540171621
ISBN 978-3-540-17162-1
No. of pages 522
Weight 739 g
Illustrations X, 522 p.
Series Lecture Notes in Computer Science
Lecture Notes in Computer Science
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.