**Higher-Order Subtyping**

Martin Steffen and Benjamin Pierce

*LFCS report ECS-LFCS-94-280*

**Subtyping in F-omega-Meet is decidable**

Adriana B Compagnoni

*LFCS report ECS-LFCS-94-281*

**Locality and Non-interleaving Semantics in calculi for mobile processes**

Davide Sangiorgi

*LFCS report ECS-LFCS-94-282*

**Interfaces and Extended ML**

Stefan Kahrs, Donald Sannella and Andrzej Tarlecki

*LFCS report ECS-LFCS-94-283*

**First-Class Polymorphism for ML**

Stefan Kahrs

*LFCS report ECS-LFCS-94-284*

**The Mobility Workbench. A tool for the pi-Calculus**

Björn Victor and Faron Moller

*LFCS report ECS-LFCS-94-285*

**A polynomial algorithm for deciding bisimilarity of normed context-free processes**

Yoram Hirshfeld, Mark Jerrum and Faron Moller

*LFCS report ECS-LFCS-94-286*

**Applying Process Refinement to a Safety-Relevant System**

Glenn Bruns

*LFCS report ECS-LFCS-94-287*

**A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes**

Yoram Hirshfeld, Mark Jerrum and Faron Moller

*LFCS report ECS-LFCS-94-288*

**Why tricategories?**

A J Power

*LFCS report ECS-LFCS-94-289*

**A very simple algorithm for estimating the number of k-colourings of a low-degree graph**

Mark Jerrum

*LFCS report ECS-LFCS-94-290*

**Congruences in Commutative Semigroups**

Yoram Hirshfeld

*LFCS report ECS-LFCS-94-291*

**Improved approximation algorithms for MAX k-CUT and MAX BISECTION**

Alan Frieze and Mark Jerrum

*LFCS report ECS-LFCS-94-292*

**On modal mu-calculus and Büchi tree automata**

Roope Kaivola

*LFCS report ECS-LFCS-94-293*

**Deciding equivalences in simple Process Algebras**

Yoram Hirshfeld

*LFCS report ECS-LFCS-94-294*

**Trapping Mutual Exclusion in the Box Calculus**

Javier Esparza and Glenn Bruns

*LFCS report ECS-LFCS-94-295*

**The Computational Complexity of Counting**

Mark Jerrum

*LFCS report ECS-LFCS-94-296*

**A fully abstract semantics for causality in the pi-calculus**

Michele Boreale and Davide Sangiorgi

*LFCS report ECS-LFCS-94-297*

**High Undecidability of Weak Bisimilarity for Petri Nets**

Petr Jancar

*LFCS report ECS-LFCS-94-298*

**On the Bisimulation Proof Method**

Davide Sangiorgi

*LFCS report ECS-LFCS-94-299*

**The Definition of Extended ML**

Stefan Kahrs, Donald Sannella, Andrzej Tarlecki

*LFCS report ECS-LFCS-94-300*

**An Old Sub-Quadratic Algorithm for Finding Extremal Sets**

Paul Pritchard

*LFCS report ECS-LFCS-94-301*

**Decidability of Model Checking for Infinite-State Concurrent Systems**

Javier Esparza

*LFCS report ECS-LFCS-94-302*

**Positive Subtyping**

Martin Hofmann and Benjamin Pierce

*LFCS report ECS-LFCS-94-303*

**A Typed Operational Semantics for Type Theory**

Healfdene Goguen

*LFCS report ECS-LFCS-94-304*

**Balancing Load under Large and Fast Load Changes in Distributed Computing Systems**

Thierry Le Sergent and Bernard Berthomieu

*LFCS report ECS-LFCS-94-305*

**Adaptive selection of protocols for strict coherency in distributed shared memory**

Thierry Le Sergent and David C J Matthews

*LFCS report ECS-LFCS-94-306*

**Axiomatic Domain Theory in Categories of Partial Maps**

Marcelo P. Fiore

*LFCS report ECS-LFCS-94-307*

**The Proof Theory and Semantics of Intuitionistic Modal Logic**

Alex K. Simpson

*LFCS report ECS-LFCS-94-308*

**On Computing the Subset Graph of a Collection of Sets**

Paul Pritchard

*LFCS report ECS-LFCS-94-309*

**Supporting Formal Reasoning about Standard ML**

Graham Collins and Stephen Gilmore

*LFCS report ECS-LFCS-94-310*

**Concurrency in a Natural Semantics**

Kevin Mitchell

*LFCS report ECS-LFCS-94-311*

**Multiple Values in Standard ML**

Kevin Mitchell

*LFCS report ECS-LFCS-94-312*

**Generating and counting Hamilton cycles in random regular graphs**

Alan Frieze, Mark Jerrum, Michael Molloy, Robert Robinson and Nicholas Wormald

*LFCS report ECS-LFCS-94-313*