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...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , , , , , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
530 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
Autres contributeurs : Andrew M. Pitts, Axel Poigné, David E. Rydeheard (directeurs scientifiques) Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Category theory and computer science, Paris, France, September 3-6, 1991, proceedings, D.H. Pitt, P.-L. Curien, S. Abramsky ... [et al.] (eds.), 1991, Berlin, Springer, 1 vol. (301 p.), Lecture notes in computer science, 0-387-54495-X • Category Theory and Computer Science, Texte imprimé, 9783662161661 |
Kazalo:
- 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.