Skip to main content
Springer Nature Link
Log in

Category Theory and Computer Science

Manchester, UK, September 5-8, 1989. Proceedings

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. David H. Pitt
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David E. Rydeheard
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Peter Dybjer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Andrew M. Pitts
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Axel Poigné
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (21 papers)

  1. Front Matter

    Download chapter PDF

  2. Coherence and valid isomorphism in closed categories applications of proof theory to category theory in a computer sclentist perspective

    • Guiseppe Longo
    Pages 1-4

  3. An algebraic view of interleaving and distributed operational semantics for CCS

    • Ugo Montanari, Daniel N. Yankelevich
    Pages 5-20

  4. Temporal structures

    • Ross Casley, Roger F. Crew, José Meseguer, Vaughan Pratt
    Pages 21-51

  5. Compositional relational semantics for indeterminate dataflow networks

    • Eugene W. Stark
    Pages 52-74

  6. Operations on records

    • Luca Cardelli, John C. Mitchell
    Pages 75-81

  7. Projections for polymorphic strictness analysis

    • John Hughes
    Pages 82-100

  8. A category-theoretic account of program modules

    • Eugenio Moggi
    Pages 101-117

  9. A note on categorical datatypes

    • G. C. Wralth
    Pages 118-127

  10. A set constructor for inductive sets in Martin-Löf's type theory

    • Kent Petersson, Dan Synek
    Pages 128-140

  11. Independence results for calculi of dependent types

    • Thomas Streicher
    Pages 141-154

  12. Quantitative domains, groupoids and linear logic

    • Paul Taylor
    Pages 155-181

  13. Graded multicategories of polynomial-time realizers

    • R. A. G. Seely
    Pages 182-197

  14. On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa

    • Bart Jacobs
    Pages 198-212

  15. Dictoses

    • Thomas Ehrhard
    Pages 213-223

  16. Declarative continuations: An investigation of duality in programming language semantics

    • Andrzej Filinski
    Pages 224-249

  17. Logic representation in LF

    • Robert Harper, Donald Sannella, Andrzej Tarlecki
    Pages 250-272

  18. Unification properties of commutative theories: A categorical treatment

    • Franz Baader
    Pages 273-299

  19. An abstract formulation for rewrite systems

    • A. J. Power
    Pages 300-312

  20. From petri nets to linear logic

    • Narciso Martí-Oliet, José Meseguer
    Pages 313-340
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top