Abstract is missing.
- PrefaceChris Hankin, Ian Mackie, Rajagopal Nagarajan.
- Games for Recursive TypesSamson Abramsky, Guy McCusker. 1-20
- Interaction Orders as GamesMichael Huth. 21-40
- A Lambda-Evaluator Based on Interaction NetsIan Mackie. 41-60
- Completeness and Continuity Properties of Applicative BisimulationAndrew M. Pitts. 61
- Combinators for Interaction NetsSimon J. Gay. 63-84
- An Internal Language for Interaction CategoriesRoy L. Crole, Simon J. Gay, Rajagopal Nagarajan. 85-104
- Categorical Logic of Concurrency and Interaction I: Synchronous ProcessesDusko Pavlovic. 105-141
- Continuation Strictness Analysis of ListsJuarez Muylaert Filho. 143-166
- Modularization and PrioritiesSarah Liebert. 167-179
- Synchronisation Trees and Fairness: A Case StudyChrysafis Hartonas, Marta Z. Kwiatkowska. 181-198
- Locales are Not PointlessSteven Vickers. 199-216
- Constructing Specifications and Modules in a KZ-doctrineGillian Hill. 217-233
- Recursion and Induction on the Real LineMartín Hötzel Escardó. 259-282
- From Chu Spaces to CposFrançois Lamarche. 283-305
- Static Analysis of Value-Passing Process CalculiDavid Clark, Lindsay Errington, Chris Hankin. 307-320
- Geometric logic as a Specification LanguageSteven Vickers. 321-340
- Refinement, Subtyping and Subclassing in VDM++Kevin Lano, S. J. Goldsack. 341-363
- Towards a GeoZ ToolkitMark Dawson, Steven Vickers. 365-380
- Denotational Semantics of Timed Dataflow ProgramsThomas P. Jensen. 381-396
- Inverse Limits of GraphsMichael B. Smyth. 397-409
- Domain of Computation of a Random Field in Statistical PhysicsAbbas Edalat. 411-430