Category Theory and Computer Science Manchester, UK, September 5-8, 1989. Proceedings

This book presents the proceedings of the Sixth International Conference on Category Theory and Computer Science, CTCS '95, held in Cambridge, UK in August 1995.The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other substructural logics, providing a new approach to proof theory. Further aspects covered are semantics of lambda calculi and type theories, program specification and development, and domain theory.

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.