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.

InhaltsangabeControl structures: A model of interaction.- Convenient category of processes and simulations I: Modulo strong bisimilarity.- Dualities between nets and automata induced by schizophrenic objects.- Relational set theory.- Proof of a S.Mac Lane conjecture (extended abstract).- Effective applicative structures.- The S-replete construction.- The convex powerdomain in a category of posets realized by cpos.- Lifting as a KZ-doctrine.- Categorical fixed point calculus.- A category-theoretic treatment of a parallel algol-like language.- Categorical reconstruction of a reduction free normalization proof.- Decomposing typed lambda calculus into a couple of categorical programming languages.- V-comprehensions and P space.- A proposed categorical semantics for ML modules.