2. TACS 1994: Sendai, Japan

@proceedings{DBLP:conf/tacs/1994,
  editor    = {Masami Hagiya and
               John C. Mitchell},
  title     = {Theoretical Aspects of Computer Software, International Conference
               TACS '94, Sendai, Japan, April 19-22, 1994, Proceedings},
  booktitle = {TACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {789},
  year      = {1994},
  isbn      = {3-540-57887-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk 1

• Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan: Full Abstraction for PCF. 1-15 BibTeX

Session 1. Lambda Calculus and Programming

• Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno: Fully Abstract Semantics for Concurrent Lambda-calculus. 16-35 BibTeX
• Douglas J. Howe, Scott D. Stoller: An Operational Approach to Combining Classical Set Theory and Functional Programming Languages. 36-55 BibTeX
• Mark P. Jones: ML Typing, Explicit Polymorphism and Qualified Types. 56-75 BibTeX
• Jon G. Riecke, Ramesh Subrahmanyam: Extensions to Type Systems Can Preserve Operational Equivalences. 76-95 BibTeX

Invited Talk 2

• Paris C. Kanellakis, Dina Q. Goldin: Constraint Programming and Database Query Languages. 96-120 BibTeX

Session 2. Automated Deduction

• Alain Hui-Bon-Hoa: Intuitionistic Resolution for a Logic Programming Language with Scoping Constructs. 121-140 BibTeX
• Yves Bertot, Gilles Kahn, Laurent Théry: Proof by Pointing. 141-160 BibTeX
• Henri Korver, Jan Springintveld: A Computer-Checked Verification of Milner's Scheduler. 161-178 BibTeX

Session 3. Functional Programming

• Masahiko Sato: A Purely Functional Language with Encapsulated Assignment. 179-202 BibTeX
• M. R. K. Krishna Rao: Simple Termination of Hierarchical Combinations of Term Rewriting Systems. 203-223 BibTeX
• Yan Mei Tang, Pierre Jouvelot: Separate Abstract Interpretation for Control-Flow Analysis. 224-243 BibTeX

Invited Talk 3

• Robert Cartwright, Matthias Felleisen: Extensible Denotational Language Specifications. 244-272 BibTeX

Session 4. Objects and Assignment

• Hideki Tsuiki: A Normalizing Calculus with Overloading and Subtyping. 273-295 BibTeX
• Martín Abadi, Luca Cardelli: A Theory of Primitive Objects - Untyped and First-Order Systems. 296-320 BibTeX
• Didier Rémy: Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types. 321-346 BibTeX
• Kung Chen, Martin Odersky: A Type System for a Lambda Calculus with Assignments. 347-364 BibTeX

Invited Talk 4

• Akinori Yonezawa: Theory and Practice of Concurrent Object-Oriented Computing. 365 BibTeX

Session 5. Concurrency I

• Andrea Asperti, Cosimo Laneve: The Family Relation in Interaction Systems. 366-384 BibTeX
• Ursula Goltz, Roberto Gorrieri, Arend Rensink: On Syntactic and Semantic Action Refinement. 385-404 BibTeX
• Davide Sangiorgi: Locality and True-concurrency in Calculi for Mobile Processes. 405-424 BibTeX

Session 6. Term Rewriting and Process Equivalence

• D. J. B. Bosscher: Term Rewriting Properties of SOS Axiomatisations. 425-439 BibTeX
• Wan Fokkink: The Tyft/Tyxt Format Reduces to Tree Rules. 440-453 BibTeX
• Hans Hüttel: Undecidable Equivalences for Basic Parallel Processes. 454-464 BibTeX

Invited Talk 5

• Masako Takahashi, Yohji Akama, Sachio Hirokawa: Normal Proofs and Their Grammar. 465-493 BibTeX

Session 7. Type Theory and Programming

• Franco Barbanera, Stefano Berardi: A Symmetric Lambda Calculus for "Classical" Program Extraction. 495-515 BibTeX
• Jakob Rehof, Morten Heine Sørensen: The Lambda_Delta-calculus. 516-542 BibTeX
• Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries: Syntactic Definitions of Undefined: On Defining the Undefined. 543-554 BibTeX
• Philippa Gardner: Discovering Needed Reductions Using Type Theory. 555-574 BibTeX

Invited Talk 6

• Moshe Y. Vardi: Nontraditional Applications of Automata Theory. 575-597 BibTeX

Session 8. Algebra, Categories and Linear Logic

• Kim Ritter Wagner: Abstract Pre-Orders. 598-617 BibTeX
• Amitavo Islam, Wesley Phoa: Categorical Models of Relational Databases I: Fibrational Formulation, Schema Integration. 618-641 BibTeX
• Max I. Kanovich: Petri Nets, Horn Programs, Linear Logic, and Vector Games. 642-666 BibTeX

Session 9. Subtyping, Intersection and Union Types

• Tatsurou Sekiguchi, Akinori Yonezawa: A Complete Type Inference System for Subtyped Recursive Types. 667-686 BibTeX
• Flemming M. Damm: Subtyping with Union Types, Intersection Types and Recursive Types. 687-706 BibTeX
• Ferruccio Damiani, Paola Giannini: A Decidable Intersection Type System based on Relevance. 707-725 BibTeX

Invited Talk 7

• Zohar Manna, Amir Pnueli: Temporal Verification Diagrams. 726-765 BibTeX

Session 10. Concurrency II

• Dominique Bolignano, Mourad Debbabi: A Semantic Theory for Concurrent ML. 766-785 BibTeX
• Kohei Honda, Nobuko Yoshida: Replication in Concurrent Combinators. 786-805 BibTeX
• Adriano Peron, Andrea Maggiolo-Schettini: Transitions as Interrupts: A New Semantics for Timed Statecharts. 806-821 BibTeX
• Marcello M. Bonsangue, Joost N. Kok: Relating Multifunctions and Predicate Transformers through Closure Operators. 822-843 BibTeX

TACS Special Open Lectures

• Kathleen Fisher, John C. Mitchell: Notes on Typed Object-Oriented Programming. 844-885 BibTeX
• Albert R. Meyer: Observing Truly Concurrent Processes. 886 BibTeX