As it stands now, we have nine people who have asked to talk. I am happy with that number, but we could also accomodate 2 or 3 more. Here is a list of talks and, insofar as I have been provided them, with titles and abstracts. Michael Robin Cockett: TBA James R. Otto: Complexity classes from categories Richard Wood: A somewhat circular characterization of the category of sets Years ago in a paper on total categories (those locally small B for which Y=yoneda:B--->PB has a left adjoint) I observed that for B=set_ there is U-|V-|W-|X-|Y and conjectured that this characterizes set_. Bob Rosebrugh and I have returned to this recently and hope to formally announce the result very soon. It builds on our work on completely distributive lattices. It probably makes good sense to say that a category B is "totally distributive" if it admits W-|X-|Y so the result can be seen as setting bounds on how "exact" a category can be. David B. Benson: Paths in Higher-Dimensional Graphs Paths in higher-dimensional graphs have arrows between arrows. These paths abstract many aspects of programming languages and related semantical matters. Higher-dimensional graphs, a concept closely akin to computad, generate free n-categories -- and hence the free cellular omega-categories. The arrows of such categories are represented by paths as the equivalence classes of paths modulo interchange. Normal forms for the presentations of paths provide fast equality tests between the represented arrows, important for the goal of programming these ideas. Two normal forms are considered. Natural normal form arises directly from the definitions. Irreducible normal form is more efficient in the use of computer storage and appears to be related to Street's exponential wedge of r-equivalences. Thomas F. Fox: TBA Charles F. Wells: Mike Wendt: On Measurably Indexed Families of Hilbert Spaces. Robert Gordon: Tricategories Michel Hebert: A syntactic characterization of locally polypresentable categories ==============================================================================