Volume 45, 2001
Aarhus, Denmark May 23 - 26, 2001
Andrej Bauer: A Relationship between Equilogical Spaces and Type Two Effectivity. 1-21
Stephen D. Brookes: Transfer Principles for Reasoning About Concurrent Programs. 22-40
Patrick Cousot, Radhia Cousot: A Case Study in Abstract Interpretation Based Program Transformation: Blocking Command Elimination. 41-64
Daniel Damian: Time Stamps for Fixed-Point Approximation. 65-76
Lei Fan: A New Approach to Quantitative Domain Theory. 77-87
Dan R. Ghica: Regular-Language Semantics for a Call-by-Value Programming Language. 106-118
Andrew D. Gordon, Alan Jeffrey: Typing Correspondence Assertions for Communication Protocols. 119-140
Joshua D. Guttman: Key Compromise, Strand Spaces, and the Authentication Tests. 141-161
John Hannan: On Extracting Static Semantics. 162-173

Achim Jung, Mathias Kegelmann, M. Andrew Moshier: Stably Compact Spaces and Closed Relations. 209-231
James Laird: A Game Semantics of Idealized CSP. 232-257
Keye Martin: Unique Fixed Points in Domain Theory. 258-268
Annabelle McIver: A Generalisation of Stationary Distributions, and Probabilistic Program Algebra. 269-279
John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague: A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report). 280-310
Lasse R. Nielsen: A Selective CPS Transformation. 311-331
John Power, Konstantinos Tourlas: An Algebraic Foundation for Graph-based Diagrams in Computing. 346-357
Jan J. M. M. Rutten: Elements of Stream Calculus (An Extensive Exercise in Coinduction). 358-423
Peter Sestoft: Demonstrating Lambda Calculus Reduction. 424-432
Hayo Thielecke: Comparing Control Constructs by Double-barrelled {CPS} Transforms. 433-447
Pawel Waszkiewicz: Distance and Measurement in Domain Theory. 448-462



