Skip to main content
  • Conference proceedings
  • © 1987

Category Theory and Computer Science

Edinburgh, UK, September 7-9, 1987. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 283)

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (16 papers)

  1. Front Matter

  2. Categories and effective computations

    • G. Rosolini
    Pages 1-11
  3. An equational presentation of higher order logic

    • Thierry Coquand, Thomas Ehrhard
    Pages 40-56
  4. Enriched categories for local and interaction calculi

    • Stefano Kasangian, Anna Labella, Alberto Pettorossi
    Pages 57-70
  5. The category of Milner processes is exact

    • David B. Benson
    Pages 71-97
  6. Relating two models of hardware

    • Glynn Winskel
    Pages 98-113
  7. Final algebras, cosemicomputable algebras, and degrees of unsolvability

    • Lawrence S. Moss, José Meseguer, Joseph A. Goguen
    Pages 158-181
  8. Viewing implementations as an institution

    • Christoph Beierle, Angelika Voß
    Pages 196-218
  9. Logical aspects of denotational semantics

    • E. Robinson
    Pages 238-253
  10. A fixpoint construction of the p-adic domain

    • Steven Vickers
    Pages 270-289
  11. A category of Galois connections

    • J. M. McDill, A. C. Melton, G. E. Strecker
    Pages 290-300

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access