Skip to main content
SpringerLink
Log in
Book cover

Category Theory and Computer Science

Paris, France, September 3-6, 1991. Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. David H. Pitt
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pierre-Louis Curien
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Samson Abramsky
    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

  6. David E. Rydeheard
    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 530)

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

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. Stone duality for stable functions

    • Thomas Ehrhard, Pasquale Malacaria
    Pages 1-15

  3. Bifinite domains: Stable case

    • Roberto M. Amadio
    Pages 16-33

  4. Local variables and non-interference in algol-like languages

    • R. D. Tennent
    Pages 34-36

  5. Categories of information systems

    • Abbas Edalat, Michael B. Smyth
    Pages 37-52

  6. Collapsing graph models by preorders

    • Raymond Hoofman, Harold Schellinx
    Pages 53-73

  7. Linear logic and interference control

    • P. W. O'Hearn
    Pages 74-93

  8. Higher dimensional word problem

    • Albert Burroni
    Pages 94-105

  9. BCK-formulas having unique proofs

    • Sachio Hirokawa
    Pages 106-120

  10. Proof nets and coherence theorems

    • Richard Blute
    Pages 121-137

  11. A modular approach to denotational semantics

    • Eugenio Moggi
    Pages 138-139

  12. Programs in partial algebras — A categorical approach

    • Grzegorz Jarzembski
    Pages 140-150

  13. Tail recursion from universal invariants

    • C. Barry Jay
    Pages 151-163

  14. A direct proof of the intuitionistic Ramsey Theorem

    • Thierry Coquand
    Pages 164-172

  15. Constructions and predicates

    • DuÅ¡ko Pavlović
    Pages 173-196

  16. Relating models of impredicative type theories

    • Bart Jacobs, Eugenio Moggi, Thomas Streicher
    Pages 197-218

  17. Two results on set-theoretic polymorphism

    • Wesley Phoa
    Pages 219-235

  18. An algebra of graphs and graph rewriting

    • Andrea Corradini, Ugo Montanari
    Pages 236-260

  19. Dataflow networks are fibrations

    • Eugene W. Stark
    Pages 261-281

  20. Applications of the calculus of trees to process description languages

    • P. Degano, S. Kasangian, S. Vigna
    Pages 282-301
Back to top

Keywords

About this book

The papers in this volume were presented at the fourth biennial Summer Conference on Category Theory and Computer Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between logic and computer science have been developed now for over twenty years, notably via the Curry-Howard isomorphism which identifies programs with proofs and types with propositions. The triangle category theory - logic - programming presents a rich world of interconnections. Topics covered in this volume include the following. Type theory: stratification of types and propositions can be discussed in a categorical setting. Domain theory: synthetic domain theory develops domain theory internally in the constructive universe of the effective topos. Linear logic: the reconstruction of logic based on propositions as resources leads to alternatives to traditional syntaxes. The proceedings of the previous three category theory conferences appear as Lecture Notes in Computer Science Volumes 240, 283 and 389.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation