Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
This collection of papers covers many applications of category theory to computer science, including the calculus of communicating systems, concurrency, operational semantics for dataflow networks, polymorphic strictness analysis, categorical datatypes, Martin-Löf's type theory, independence results for calculi of dependent types, quantitative domains, polynomial-time realizability, the semantics of the second order lambda calculus, and duality in programming language semantics. In particular, relations between Petri nets and linear logic are disclosed (N. Martí-Oliet and J. Meseguer), and a categorical model of linear logic is constructed (V. C. V. de Paiva). The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 0632.00018]. Indexed articles: \textit{Longo, Guiseppe}, Coherence and valid isomorphism in closed categories. Applications of proof theory to category theory in a computer scientist perspective (notes for an invited lecture), 1-4 [Zbl 1496.03134] \textit{Montanari, Ugo; Yankelevich, Daniel N.}, An algebraic view of interleaving and distributed operational semantics for CCS, 5-20 [Zbl 1493.68198] \textit{Casley, Ross; Crew, Roger F.; Meseguer, José; Pratt, Vaughan}, Temporal structures, 21-51 [Zbl 1493.68241] \textit{Stark, Eugene W.}, Compositional relational semantics for indeterminate dataflow networks, 52-74 [Zbl 1493.68199] \textit{Cardelli, Luca; Mitchell, John C.}, Operations on records (extended abstract), 75-81 [Zbl 1493.68082] \textit{Hughes, John}, Projections for polymorphic strictness analysis, 82-100 [Zbl 1493.68110] \textit{Moggi, Eugenio}, A category-theoretic account of program modules, 101-117 [Zbl 1493.68118] \textit{Wraith, G. C.}, A note on categorical datatypes, 118-127 [Zbl 1493.68232] \textit{Petersson, Kent; Synek, Dan}, A set constructor for inductive sets in Martin-Löf's type theory, 128-140 [Zbl 1493.68119] \textit{Streicher, Thomas}, Independence results for calculi of dependent types, 141-154 [Zbl 1496.03266] \textit{Taylor, Paul}, Quantitative domains, groupoids and linear logic, 155-181 [Zbl 1493.18015] \textit{Seely, R. A. G.}, Graded multicategories of polynomial-time realizers, 182-197 [Zbl 1493.68122] \textit{Jacobs, Bart}, On the semantics of second order lambda calculus: from Bruce-Meyer-Mitchell models to hyperdoctrine models and vice-versa, 198-212 [Zbl 1496.03061] \textit{Ehrhard, Thomas}, Dictoses, 213-223 [Zbl 1496.03264] \textit{Filinski, Andrzej}, Declarative continuations: an investigation of duality in programming language semantics, 224-249 [Zbl 1493.68108] \textit{Harper, Robert; Sannella, Donald; Tarlecki, Andrzej}, Logic representation in LF. Report on work in progress, 250-272 [Zbl 1496.03055] \textit{Baader, Franz}, Unification properties of commutative theories: a categorical treatment, 273-299 [Zbl 1496.03036] \textit{Power, A. J.}, An abstract formulation for rewrite systems, 300-312 [Zbl 1493.68178] \textit{Martí-Oliet, Narciso; Meseguer, José}, From Petri nets to linear logic, 313-340 [Zbl 1493.68250] \textit{de Paiva, Valeria C. V.}, A Dialectica-like model of linear logic, 341-356 [Zbl 1496.03252] \textit{Aczel, Peter; Mendler, Nax}, A final coalgebra theorem, 357-365 [Zbl 1496.03206]
scientific article; zbMATH DE number 195066