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).
The interest in semantics of dataflow networks is to a large extent due to the work by Kahn ( 14 ) , who proposed an elegant semantic model for dataflow networks with only deterministic processes . However , the straight - forward ...
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages 2 Douglas J. Howe1 and Scott D. Stoller2 1 AT & T Bell Labs , 600 Mountain Ave. , Room 2B - 438 Murray Hill , NJ 07974 ...
This book shows how these two seemingly disparate aspects of Computer Science are intimately related. Further, the book treats the theoretical side of Computer Science as well, which also derives from Turing's research.
This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science.
This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science.
The gain obtained by shrinking e , gain ( e ) , is defined as the difference in the costs of the initial and final M STs . To shrink a triple z { a , b , c } e Co ( which we shall call a triangle ) is to place two zero weight blue edges ...
The author examines logic and methodology of design from the perspective of computer science.
In Orna Grumberg, editor, Computer-Aided Verification (CAV '97), LNCS 1254, pages 400–411. Springer-Verlag, 1997. 5. J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential circuit verification using symbolic model ...