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