Abstract is missing.
- An Introduction to ::::n::::-CategoriesJohn C. Baez. 1-33
- Allegories as a Basis for AlgorithmicsRichard S. Bird. 34-46
- Separating Shape from DataC. Barry Jay. 47-48
- A Factorisation Theorem in Rewriting TheoryPaul-André Melliès. 49-68
- Monads and Modular Term RewritingChristoph Lüth, Neil Ghani. 69-86
- A 2-Categorical Presentation of Term Graph RewritingAndrea Corradini, Fabio Gadducci. 87-105
- Presheaf Models for the pi-CalculusGian Luca Cattani, Ian Stark, Glynn Winskel. 106-126
- Categorical Modelling of Structural Operational Rules: Case StudiesDaniele Turi. 127-146
- Specifying Interaction CategoriesDusko Pavlovic, Samson Abramsky. 147-158
- Shedding the New Light in the World of Logical SystemsUwe Wolter, Alfio Martini. 159-176
- Combining and Representing Logical SystemsTill Mossakowski, Andrzej Tarlecki, Wieslaw Pawlowski. 177-196
- A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log:::2:::(n))Alexander E. Andreev, Sergei Soloviev. 197-209
- Effectiveness of the Global Modulus of Continuity on Metric SpacesKlaus Weihrauch, Xizhong Zheng. 210-219
- Proof Principles for Datatypes with Iterated RecursionUlrich Hensel, Bart Jacobs. 220-241
- When Do Datatypes Commute?Paul F. Hoogendijk, Roland Carl Backhouse. 242-260
- A Calculus for Collections and AggregatesS. Kazem Lellahi, Val Tannen. 261-280
- LiftingAnna Bucalo, Giuseppe Rosolini. 281-292
- General Synthetic Domain Theory - A Logical ApproachBernhard Reus, Thomas Streicher. 293-313