Category theory and computer science : Manchester, UK, September 5-8, 1989 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
389 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, Manchester, UK, September 5-8, 1989, proceedings, D.H. Pitt, D.E. Rydeheard, P. Dybjer... [et al.] (eds.), Berlin, Springer-Verlag, 1989, 1 vol. (VI-365 p.), Lecture notes in computer science, 3-540-51662-X • Category Theory and Computer Science, Texte imprimé, 9783662175101 |
Obsah:
- Coherence and valid isomorphism in closed categories applications of proof theory to category theory in a computer sclentist perspective
- An algebraic view of interleaving and distributed operational semantics for CCS
- Temporal structures
- Compositional relational semantics for indeterminate dataflow networks
- Operations on records
- Projections for polymorphic strictness analysis
- A category-theoretic account of program modules
- A note on categorical datatypes
- A set constructor for inductive sets in Martin-Löf's type theory
- Independence results for calculi of dependent types
- Quantitative domains, groupoids and linear logic
- Graded multicategories of polynomial-time realizers
- On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa
- Dictoses
- Declarative continuations: An investigation of duality in programming language semantics
- Logic representation in LF
- Unification properties of commutative theories: A categorical treatment
- An abstract formulation for rewrite systems
- From petri nets to linear logic
- A dialectica-like model of linear logic
- A final coalgebra theorem.