The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Olivier Danvy
    Many Happy Returns. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:1- [Conf]
  2. Martin Hofmann
    From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:2-3 [Conf]
  3. Dag Normann
    Definability of Total Objects in PCF and Related Calculi. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:4-5 [Conf]
  4. Peter Selinger
    Categorical Semantics of Control. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:6-7 [Conf]
  5. Thorsten Altenkirch
    Representations of First Order Function Types as Terminal Coalgebras. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:8-21 [Conf]
  6. Thorsten Altenkirch, Thierry Coquand
    A Finitary Subsystem of the Polymorphic lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:22-28 [Conf]
  7. Martin Berger, Kohei Honda, Nobuko Yoshida
    Sequentiality and the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:29-45 [Conf]
  8. Luca Cardelli, Andrew D. Gordon
    Logical Properties of Name Restriction. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:46-60 [Conf]
  9. Juliusz Chroboczek
    Subtyping Recursive Games. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:61-75 [Conf]
  10. Paolo Coppola, Simone Martini
    Typing Lambda Terms in Elementary Logic with Linear Constraints. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:76-90 [Conf]
  11. Norman Danner
    Ramified Recurrence with Dependent Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:91-105 [Conf]
  12. Pietro Di Gianantonio
    Game Semantics for the Pure Lazy lambda-calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:106-120 [Conf]
  13. Daniel J. Dougherty, Pierre Lescanne
    Reductions, Intersection Types, and Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:121-135 [Conf]
  14. Gilles Dowek
    The Stratified Foundations as a Theory Modulo. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:136-150 [Conf]
  15. Andrzej Filinski
    Normalization by Evaluation for the Computational Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:151-165 [Conf]
  16. Herman Geuvers
    Induction Is Not Derivable in Second Order Dependent Type Theory. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:166-181 [Conf]
  17. Philippe de Groote
    Strong Normalization of Classical Natural Deduction with Disjunction. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:182-196 [Conf]
  18. Esfandiar Haghverdi
    Partially Additive Categories and Fully Complete Models of Linear Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:197-216 [Conf]
  19. C. Barry Jay
    Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:217-239 [Conf]
  20. Thierry Joly
    The Finitely Generated Types of the lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:240-252 [Conf]
  21. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Deciding Monadic Theories of Hyperalgebraic Trees. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:253-267 [Conf]
  22. James Laird
    A Deconstruction of Non-deterministic Classical Cut Elimination. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:268-282 [Conf]
  23. Olivier Laurent
    A Token Machine for Full Geometry of Interaction. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:283-297 [Conf]
  24. Hans Leiß
    Second-Order Pre-Logical Relations and Representation Independence. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:298-314 [Conf]
  25. Ugo de'Liguoro
    Characterizing Convergent Terms in Object Calculi via Intersection Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:315-328 [Conf]
  26. Ralph Matthes
    Parigot's Second Order lambda-mu-Calculus and Inductive Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:329-343 [Conf]
  27. Alexandre Miquel
    The Implicit Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:344-359 [Conf]
  28. Andrzej S. Murawski, C.-H. Luke Ong
    Evolving Games and Essential Nets for Affine Polymorphism. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:360-375 [Conf]
  29. Vincent Padovani
    Retracts in Simple Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:376-384 [Conf]
  30. Jorge Sousa Pinto
    Parallel Implementation Models for the lambda-Calculus Using the Geometry of Interaction. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:385-399 [Conf]
  31. Aleksy Schubert
    The Complexity of beta-Reduction in Low Orders. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:400-414 [Conf]
  32. Christian Urban
    Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:415-430 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002