These conference proceedings document the exploitation of links between logic and category theory, leading to a solid basis of much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other substructural logics.

Control 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.