bokomslag Category Theory and Computer Programming
Data & IT

Category Theory and Computer Programming

David Pitt Samson Abramsky Axel Poigne David Rydeheard

Pocket

1009:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 522 sidor
  • 1986
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.

  • Författare: David Pitt, Samson Abramsky, Axel Poigne, David Rydeheard
  • Format: Pocket/Paperback
  • ISBN: 9783540171621
  • Språk: Engelska
  • Antal sidor: 522
  • Utgivningsdatum: 1986-10-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K