This book constitutes the refereed proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software, TACS 2001, held in Sendai, Japan, in October 2001. The book presents 21 selected and revised full papers. Also included are six invited papers plus one open lecture by internationally leading scientists. Among the topics addressed are automata theory, concurrency, control-flow analysis, lambda calculi, model checking and program logic.

Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Contents Tutorial * Applications * Further Reading