1. TLCA 1993: Utrecht, The Netherlands

@proceedings{DBLP:conf/tlca/1993,
  editor    = {Marc Bezem and
               Jan Friso Groote},
  title     = {Typed Lambda Calculi and Applications, International Conference
               on Typed Lambda Calculi and Applications, TLCA '93, Utrecht,
               The Netherlands, March 16-18, 1993, Proceedings},
  booktitle = {TLCA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {664},
  year      = {1993},
  isbn      = {3-540-56517-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Yohji Akama: On Mints' Reduction for ccc-Calculus. 1-12 BibTeX
• Thorsten Altenkirch: A Formalization of the Strong Normalization Proof for System F in LEGO. 13-28 BibTeX
• Steffen van Bakel: Partial Intersection Type Assignment in Applicative Term Rewriting Systems. 29-44 BibTeX
• Franco Barbanera, Stefano Berardi: Extracting Constructive Content from Classical Logic via Control-like Reductions. 45-59 BibTeX
• Franco Barbanera, Maribel Fernández: Combining First and Higher Order Rewrite Systems with Type Assignment Systems. 60-74 BibTeX
• P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: A Term Calculus for Intuitionistic Linear Logic. 75-90 BibTeX
• Ulrich Berger: Program Extraction from Normalization Proofs. 91-106 BibTeX
• Giuseppe Castagna, Giorgio Ghelli, Giuseppe Longo: A Semantics for Lambda&-early: A Calculus with Overloading and Early Binding. 107-123 BibTeX
• Pietro Di Gianantonio, Furio Honsell: An Abstract Notion of Application. 124-138 BibTeX
• Gilles Dowek: The Undecidability of Typability in the Lambda-Pi-Calculus. 139-145 BibTeX
• Giorgio Ghelli: Recursive Types Are not Conservative over F. 146-162 BibTeX
• Philippe de Groote: The Conservation Theorem revisited. 163-178 BibTeX
• J. M. E. Hyland, C.-H. Luke Ong: Modified Realizability Toposes and Strong Normalization Proofs. 179-194 BibTeX
• Bart Jacobs: Semantics of lambda-I and of other substructure lambda calculi. 195-208 BibTeX
• Bart Jacobs, Thomas F. Melham: Translating Dependent Type Theory into Higher Order Logic. 209-229 BibTeX
• Achim Jung, Allen Stoughton: Studying the Fully Abstract Model of PCF within its Continuous Function Model. 230-244 BibTeX
• Achim Jung, Jerzy Tiuryn: A New Characterization of Lambda Definability. 245-257 BibTeX
• Hans Leiß: Combining Recursive and Dynamic Types. 258-273 BibTeX
• Daniel Leivant, Jean-Yves Marion: Lambda calculus characterizations of poly-time. 274-288 BibTeX
• James McKinna, Robert Pollack: Pure Type Systems Formalized. 289-305 BibTeX
• Tobias Nipkow: Orthogonal Higher-Order Rewrite Systems are Confluent. 306-317 BibTeX
• Daniel F. Otth: Monotonic versus Antimonotonic Exponentation. 318-327 BibTeX
• Christine Paulin-Mohring: Inductive Definitions in the system Coq - Rules and Properties. 328-345 BibTeX
• Benjamin C. Pierce: Intersection Types and Bounded Polymorphism. 346-360 BibTeX
• Gordon D. Plotkin, Martín Abadi: A Logic for Parametric Polymorphism. 361-375 BibTeX
• Kurt Sieber: Call-by-Value and Nondeterminism. 376-390 BibTeX
• Jan Springintveld: Lower and Upper Bounds for Reductions of Types in Lambda-omega and Lambda-P. 391-405 BibTeX
• Masako Takahashi: Lambda-Calculi with Conditional Rules. 406-417 BibTeX
• Pawel Urzyczyn: Type reconstruction in F-omega is undecidable. 418-432 BibTeX