3. TLCA 1997: Nancy, France

Philippe de Groote (Ed.): Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings. Lecture Notes in Computer Science 1210 Springer 1997, ISBN 3-540-62688-3 BibTeX

@proceedings{DBLP:conf/tlca/1997,
  editor    = {Philippe de Groote},
  title     = {Typed Lambda Calculi and Applications, Third International Conference
               on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France,
               April 2-4, 1997, Proceedings},
  booktitle = {TLCA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1210},
  year      = {1997},
  isbn      = {3-540-62688-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Yohji Akama: A Lambda-to-CL Translation for Strong Normalization. 1-10 BibTeX
Gianna Bellè, Eugenio Moggi: Typed Intermediate Languages for Shape Analysis. 11-29 BibTeX
Stefano Berardi, Luca Boerio: Minimum Information Code in a Pure Functional Language with Data Types. 30-45 BibTeX
Viviana Bono, Michele Bugliesi: Matching Constraints for the Lambda Calculus of Objects. 46-62 BibTeX
Michael Brandt, Fritz Henglein: Coinductive Axiomatization of Recursive Type Equality and Subtyping. 63-81 BibTeX
Torben Braüner: A Simple Adequate Categorical Model for PCF. 82-98 BibTeX
Antonio Bucciarelli: Logical Reconstruction of Bi-domains. 99-111 BibTeX
Judicaël Courant: A Module Calculus for Pure Type Systems. 112-128 BibTeX
Ferruccio Damiani, Paola Giannini: An Inference Algorithm for Strictness. 129-146 BibTeX
Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann: Primitive Recursion for Higher-Order Abstract Syntax. 147-163 BibTeX
Neil Ghani: Eta-Expansions in Dependent Type Theory - The Calculus of Constructions. 164-180 BibTeX
Stefano Guerrini, Simone Martini, Andrea Masini: Proof Nets, Garbage, and Computations. 181-195 BibTeX
Masahito Hasegawa: Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi. 196-213 BibTeX
Hugo Herbelin: Games and Weak-Head Reduction for Classical PCF. 214-230 BibTeX
Toshihiko Kurata: A Type Theoretical View of Böhm-Trees. 231-247 BibTeX
Marina Lenisa: Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi. 248-266 BibTeX
Jan Malolepszy, Malgorzata Moczurad, Marek Zaionc: Schwichtenberg-Style Lambda Definability Is Undecidable. 267-283 BibTeX
Femke van Raamsdonk: Outermost-Fair Rewriting. 284-299 BibTeX
Christian Retoré, Pomset Logic: A Non-commutative Extension of Classical Linear Logic. 300-318 BibTeX
Harald Rueß: Computational Reflection in the Calculus of Constructions and its Application to Theorem Proving. 319-335 BibTeX
Ian Stark: Names, Equations, Relations: Practical Ways to Reason about new. 336-353 BibTeX
Izumi Takeuti: An Axiomatic System of Parametricity. 354-372 BibTeX
Pawel Urzyczyn: Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). 373-389 BibTeX
Hongwei Xi: Weak and Strong Beta Normalisations in Typed Lambda-Calculi. 390-404 BibTeX