Message from the General Chair (PDF)
Message from the Program Chair (PDF)
Conference Organization (PDF)
Kleene Award for Best Student Paper - 1997 (PDF)
Reviewers (PDF)
Combination of Compatible Reduction Orderings that are Total on Ground Terms (Abstract)
Automata-driven automated induction (Abstract)
Ground Reducibility is EXPTIME-complete (Abstract)
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Abstract)
Temporal Linear Logic Specifications for Concurrent Processes (Abstract)
Full abstraction for functional languages with control (Abstract)
Believe it or not, AJM's games model is a model of classical linear logic (Abstract)
Games and Definability for System F (Abstract)
Boolean Expression Diagrams (Abstract)
How much memory is needed to win infinite games? (Abstract)
Quantitative Analysis and Model Checking (Abstract)
A Partially Deadlock-free Typed Process Calculus (Abstract)
Unique Fixpoint Induction for Value-Passing Processes (Abstract)
Bisimulation for Labelled Markov Processes (Abstract)
A Kleene theorem for timed automata (Abstract)
Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices (Abstract)
An Exprssively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. (Abstract)
On the Complexity of Reasoning in Kleene Algebra (Abstract)
Large finite structures with few L^k-types (Abstract)
First-Order Logic with Two Variables and Unary Temporal (Abstract)
Semantics of Exact Real Arithmetic (Abstract)
A Relational Account of Call-by-Value Sequentially (Abstract)
Complete Cuboidal Sets in Axiomatic Domain Theory (Abstract)
Towards a Mathematical Operational Semantics (Abstract)
The "Hardest'' Natural Decidable Theory (Abstract)
Two-variable logic with counting is decidable (Abstract)
Complexity of Two-Variable Logic with Counting (Abstract)
Complexity of Power Default Reasoning (Abstract)
On the Cubic Bottleneck in Subtyping and Flow Analysis (Abstract)
The complexity of subtype entailment for simple types (Abstract)
Set constraints with intersection (Abstract)
Continuation models are universal for lambda-mu-calculus (Abstract)
Discrimination by Parallel Observers (Abstract)
Linear higher-order pre-unification (Abstract)
A Logic for Reasoning with Higher-Order Abstract Syntax (Abstract)
Author Index (PDF)
