3. TACS 1997: Sendai, Japan

@proceedings{DBLP:conf/tacs/1997,
  editor    = {Mart\'{\i}n Abadi and
               Takayasu Ito},
  title     = {Theoretical Aspects of Computer Software, Third International
               Symposium, TACS '97, Sendai, Japan, September 23-26, 1997, Proceedings},
  booktitle = {TACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1281},
  year      = {1997},
  isbn      = {3-540-63388-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk 1

• Robin Milner:
  Strong Normalisation in Higher-Order Action Calculi. 1-19
  

Session 1

• Jacques Garrigue, Didier Rémy:
  Extending ML with Semi-Explicit Higher-Order Polymorphism. 20-46
  
• Alexander Aiken, Edward L. Wimmers, Jens Palsberg:
  Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract). 47-76
  
• Zena M. Ariola, Stefan Blom:
  Cyclic Lambda Calculi. 77-106
  

Invited Talk

• Atsushi Ohori:
  Type System for Specializing Polymorphism. 107-137
  

Session 2

• Mario Coppo, Ferruccio Damiani, Paola Giannini:
  On Strictness and Totality. 138-164
  
• Julia L. Lawall, Peter Thiemann:
  Sound Specialization in the Presence of Computational Effects. 165-190
  

Session 3

• Yoshiki Kinoshita, Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent:
  An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement. 191-212
  
• Marcello M. Bonsangue, Joost N. Kok:
  Infinitary Domain Logic for Finitary Transition Systems. 213-232
  

Invited Talk 3

• Jean-Jacques Lévy:
  Some Results in the Joint-Calculus. 233-249
  

Session 4

• Julian Rathke, Matthew Hennessy:
  Local Model Checking for Value-Passing Processes (Extended Abstract). 250-266
  
• Kaisa Sere, Marina A. Waldén:
  Data Refinement and Remote Procedures. 267-294
  
• Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan:
  A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems. 295-320
  

Invited Talk 4

• Carolyn L. Talcott:
  Composable Semantic Models for Actor Theories. 321-364
  

Session 5

• Franco Barbanera, Stefano Berardi, Massimo Schivalocchi:
  "Classical" Programming-with-Proofs in lambda_PA^Sym: An Analysis of Non-confluence. 365-390
  
• John Power, Hayo Thielecke:
  Environments, Continuation Semantics and Indexed Categories. 391-414
  

Session 6

• Kim B. Bruce, Luca Cardelli, Benjamin C. Pierce:
  Comparing Object Encodings. 415-438
  
• Erik Poll:
  System F with Width-Subtyping and Record Updating. 439-457
  

Invited Talk

• Lars Birkedal, Robert Harper:
  Relational Interpretations of Recursive Types in an operational Setting (Summary). 458-490
  

Session 7

• Seán Matthews:
  Extending a Logical Framework with a Modal Connective for Validity. 491-514
  
• Samuel Boutin:
  Using Reflection to Build Efficient and Certified Decision Procedures. 515-529
  
• Benjamin Werner:
  Sets in Types, Types in Sets. 530-346
  

Session 8

• Richard Mayr:
  Combining Petri Nets and PA-Processes. 547-561
  
• Satoshi Yamane, Kazuhiro Nakamura:
  Symbolic Model-Checking Method Based on Approximations and Binary Decision Diagrams for Real-Time Systems. 562-582
  
• Philippa Gardner, Masahito Hasegawa:
  Types and Models for Higher-Order Action Calculi. 583-603
  

Invited Talk 6

• Gérard P. Huet, Henri Laulhère:
  Finite-State Transducers as Regular Böhm Trees. 604-610
  

TACS Open Lecture

• Martín Abadi:
  Secrecy by Typing inSecurity Protocols. 611-638
  

Last update Tue Feb 14 03:17:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page