1. TACS 1991: Sendai, Japan

Invited Paper

• Gordon D. Plotkin:
  A Semantics for Type Checking. 1-17
  

Session 1

• Paola Giannini, Simona Ronchi Della Rocca:
  Type Inference in Polymorphic Type Discipline. 18-37
  
• Makoto Tatsuta:
  Monotone Recursive Definition of Predicates and Its Realizability Interpretation. 38-52
  

Invited Paper

• Masahiko Sato:
  Adding Proof Objects and Inductive Definition Mechanisms to Frege Structures. 53-87
  

Session 2

• Wesley Phoa:
  From Term Models to Domains. 88-111
  
• Carl A. Gunter, Elsa L. Gunter, David B. MacQueen:
  An Abstract Interpretation for ML Equality Kinds. 112-130
  

Invited Paper

• Trevor Jim, Albert R. Meyer:
  Full Abstraction and the Context Lemma. 131-151
  

Session 3

• S. Arun-Kumar, Matthew Hennessy:
  An Efficiency Preorder for Processes. 152-175
  
• Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
  On Nets, Algebras and Modularity. 176-203
  
• Bengt Jonsson, Joost N. Kok:
  Towards a Complete Hierarchy of Compositional Dataflow Models. 204-225
  

Invited Paper

• Robert L. Constable:
  Type Theory as a Foundation for Computer Science. 226-243
  

Invited Paper

• Amir Pnueli, M. Shalev:
  What is in a Step: On the Semantics of Statecharts. 244-264
  

Session 4

• Krzysztof R. Apt, Dino Pedreschi:
  Proving Termination of General Prolog Programs. 265-289
  
• John C. Mitchell:
  On Abstraction and the Expressive Power of Programming Languages. 290-310
  

Invited Paper

• Kazuhiro Fuchi, Koichi Furukawa:
  Role of Logic Programming in the FGCS Project. 311-325
  

Session 5

• Martín Abadi, Michael Burrows, C. Kaufman, Butler W. Lampson:
  Authentication and Delegation with Smart-cards. 326-345
  
• Bernhard Steffen:
  Data Flow Analysis as Model Checking. 346-365
  
• Phil Pfeiffer, Rebecca Parsons Selke:
  On the Adequacy of Dependence-Based Representations for Programs with Heaps. 365-386
  

Invited Paper

• Masami Hagiya:
  From Programming-by-Example to Proving-by-Example. 387-419
  

Invited Paper

• Jean-Louis Lassez:
  From LP to LP: Programming with Constraints. 420-446
  

Session 6

• Dieter Armbruster:
  Polynomial Recursion Analysis in Pascal Like Programs. 447-458
  
• Hardi Hungar:
  Complexity of Proving Program Correctness. 459-474
  
• David A. Basin, Douglas J. Howe:
  Some Normalization Properties of Martin-Löf's Type Theory, and Applications. 475-494
  
• Ryu Hasegawa:
  Parametricity of Extensionally Collapsed Term Models of Polymorphism and Their Categorical Properties. 495-512
  
• Shin-ya Nishizaki:
  Programs with Continuations and Linear Logic. 513-531
  

Session 7

• David Walker:
  Pi-Calculus Semantics of Object-Oriented Programming Languages. 532-547
  
• Andreas V. Hense:
  Wrapper Semantics of an Object-Oriented Programming Language with State. 548-568
  
• Mark Ryan, José Luiz Fiadeiro, T. S. E. Maibaum:
  Sharing Actions and Attributes in Modal Action Logic. 569-593
  
• Ralf Treinen:
  First Order Data Types and First Order Logic. 594-614
  
• Max I. Kanovich:
  Efficient Program Synthesis: Semantics, Logic, Complexity. 615-632
  

Session 8

• Sachio Hirokawa:
  Principal Type-Schemes of BCI-Lambda-Terms. 633-650
  
• Franco Barbanera, Mariangiola Dezani-Ciancaglini:
  Intersection and Union Types. 651-674
  
• John C. Reynolds:
  The Coherence of Languages with Intersection Types. 675-700
  

Invited Paper

• Susumu Hayashi:
  Singleton, Union and Intersection Types for Program Extraction. 701-730
  

Session 9

• Pierre-Louis Curien, Giorgio Ghelli:
  Subtyping + Extensionality: Confluence of beta-eta-top reduction in F_<=. 731-749
  
• Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov:
  An Extension of System F with Subtyping. 750-770
  

Invited Lecture

• Dana S. Scott: Will Logicians be Replaced by Machines? 771

Last update Wed May 22 16:43:01 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page