Category Theory and Computer Science: Manchester, UK, September 5–8, 1989 Proceedings

Coherence and valid isomorphism in closed categories applications of proof theory to category theory in a computer sclentist perspective....Pages 1-4
An algebraic view of interleaving and distributed operational semantics for CCS....Pages 5-20
Temporal structures....Pages 21-51
Compositional relational semantics for indeterminate dataflow networks....Pages 52-74
Operations on records....Pages 75-81
Projections for polymorphic strictness analysis....Pages 82-100
A category-theoretic account of program modules....Pages 101-117
A note on categorical datatypes....Pages 118-127
A set constructor for inductive sets in Martin-Löf\'s type theory....Pages 128-140
Independence results for calculi of dependent types....Pages 141-154
Quantitative domains, groupoids and linear logic....Pages 155-181
Graded multicategories of polynomial-time realizers....Pages 182-197
On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa....Pages 198-212
Dictoses....Pages 213-223
Declarative continuations: An investigation of duality in programming language semantics....Pages 224-249
Logic representation in LF....Pages 250-272
Unification properties of commutative theories: A categorical treatment....Pages 273-299
An abstract formulation for rewrite systems....Pages 300-312
From petri nets to linear logic....Pages 313-340
A dialectica-like model of linear logic....Pages 341-356
A final coalgebra theorem....Pages 357-365