Theoretical Aspects of Computer Software

1. Session 6

   1. Weakest Congruence Results Concerning “Any-Lock”

      • Antti Puhakka

      Pages 400-419

2. Invited Talk 5

   1. Design and Correctness of Program Transformations Based on Control-Flow Analysis

      • Anindya Banerjee, Nevin Heintze, Jon G. Riecke

      Pages 420-447

3. Session 7

   1. Infinite Intersection and Union Types for the Lazy Lambda Calculus

      • Marcello M. Bonsangue, Joost N. Kok

      Pages 448-458

   2. Strong Normalization of Second Order Symmetric Lambda-mu Calculus

      • Yoriyuki Yamagata

      Pages 459-467

   3. The Girard-Reynolds Isomorphism

      • Philip Wadler

      Pages 468-491

4. Invited Talk 6

   1. Lightweight Analysis of Object Interactions

      • Daniel Jackson, Alan Fekete

      Pages 492-513

5. Session 8

   1. Typing Assembly Programs with Explicit Forwarding

      • Lennart Beringer

      Pages 514-534

   2. The UDP Calculus: Rigorous Semantics for Real Networking

      • Andrei Serjantov, Peter Sewell, Keith Wansbrough

      Pages 535-559

6. TACS Open Lecture

   1. Unison: A File Synchronizer and Its Specification

      • Benjamin C. Pierce, Jérôme Vouillon

      Pages 560-560

7. Back Matter

   Pages 561-561

   PDF

This volume constitutes the proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software (TACS 2001) held at Tohoku U- versity, Sendai, Japan in October 2001. The TACS symposium focuses on the theoretical foundations of progr- ming and their applications. As this volume shows, TACS is an international symposium, with participants from many di?erent institutions and countries. TACS 2001 was the fourth symposium in the TACS series, following TACS’91, TACS’94, and TACS’97, whose proceedings were published as Volumes 526, 789, and 1281, respectively, of Springer-Verlag’s Lecture Notes in Computer Science series. The TACS 2001 technical program consisted of invited talks and contributed talks. In conjunction with this program there was a special open lecture by Benjamin Pierce; this lecture was open to non-registrants. TACS 2001 bene?ted from the e?orts of many people; in particular, members of the Program Committee and the Organizing Committee. Our special thanks go to the Program Committee Co-chairs: Naoki Kobayashi (Tokyo Institute of Technology) Benjamin Pierce (University of Pennsylvania).

• Action Calculi
• Automat
• Concurrency
• Control-Flow Analysis
• Model Checking
• Program Logic
• Program Semantics
• automata
• lambda calculus
• logic

• Department of Computer Science, Tokyo Institute of Technology Graduate School of Information Science and Engineering, Tokyo, Japan

  Naoki Kobayashi

• Department of Computer and Information Science, University of Pennsylvania, Philadelphia, USA

  Benjamin C. Pierce

Policies and ethics