Conferences in DBLP

International Conference on Typed Lambda Calculus and Applications (TLCA) (tlca)
1997 (conf/tlca/1997)

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