Category Theory and Computer Science Paris, France, September 3-6, 1991. Proceedings
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 c...
| Other Authors: | , , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1991, 1991
|
| Edition: | 1st ed. 1991 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Stone duality for stable functions
- Bifinite domains: Stable case
- Local variables and non-interference in algol-like languages
- Categories of information systems
- Collapsing graph models by preorders
- Linear logic and interference control
- Higher dimensional word problem
- BCK-formulas having unique proofs
- Proof nets and coherence theorems
- A modular approach to denotational semantics
- Programs in partial algebras — A categorical approach
- Tail recursion from universal invariants
- A direct proof of the intuitionistic Ramsey Theorem
- Constructions and predicates
- Relating models of impredicative type theories
- Two results on set-theoretic polymorphism
- An algebra of graphs and graph rewriting
- Dataflow networks are fibrations
- Applications of the calculus of trees to process description languages