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

Bibliographic Details
Other Authors: Pitt, David (Editor), Abramsky, Samson (Editor), Poigne, Axel (Editor), Rydeheard, David (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1986, 1986
Edition:1st ed. 1986
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table 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