Conferences in DBLP
Olivier Danvy Many Happy Returns. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:1- [Conf ] 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 ] Dag Normann Definability of Total Objects in PCF and Related Calculi. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:4-5 [Conf ] Peter Selinger Categorical Semantics of Control. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:6-7 [Conf ] Thorsten Altenkirch Representations of First Order Function Types as Terminal Coalgebras. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:8-21 [Conf ] Thorsten Altenkirch , Thierry Coquand A Finitary Subsystem of the Polymorphic lambda-Calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:22-28 [Conf ] Martin Berger , Kohei Honda , Nobuko Yoshida Sequentiality and the pi-Calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:29-45 [Conf ] Luca Cardelli , Andrew D. Gordon Logical Properties of Name Restriction. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:46-60 [Conf ] Juliusz Chroboczek Subtyping Recursive Games. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:61-75 [Conf ] Paolo Coppola , Simone Martini Typing Lambda Terms in Elementary Logic with Linear Constraints. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:76-90 [Conf ] Norman Danner Ramified Recurrence with Dependent Types. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:91-105 [Conf ] Pietro Di Gianantonio Game Semantics for the Pure Lazy lambda-calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:106-120 [Conf ] Daniel J. Dougherty , Pierre Lescanne Reductions, Intersection Types, and Explicit Substitutions. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:121-135 [Conf ] Gilles Dowek The Stratified Foundations as a Theory Modulo. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:136-150 [Conf ] Andrzej Filinski Normalization by Evaluation for the Computational Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:151-165 [Conf ] Herman Geuvers Induction Is Not Derivable in Second Order Dependent Type Theory. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:166-181 [Conf ] Philippe de Groote Strong Normalization of Classical Natural Deduction with Disjunction. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:182-196 [Conf ] Esfandiar Haghverdi Partially Additive Categories and Fully Complete Models of Linear Logic. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:197-216 [Conf ] 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 ] Thierry Joly The Finitely Generated Types of the lambda-Calculus. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:240-252 [Conf ] Teodor Knapik , Damian Niwinski , Pawel Urzyczyn Deciding Monadic Theories of Hyperalgebraic Trees. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:253-267 [Conf ] James Laird A Deconstruction of Non-deterministic Classical Cut Elimination. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:268-282 [Conf ] Olivier Laurent A Token Machine for Full Geometry of Interaction. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:283-297 [Conf ] Hans Leiß Second-Order Pre-Logical Relations and Representation Independence. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:298-314 [Conf ] Ugo de'Liguoro Characterizing Convergent Terms in Object Calculi via Intersection Types. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:315-328 [Conf ] Ralph Matthes Parigot's Second Order lambda-mu-Calculus and Inductive Types. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:329-343 [Conf ] Alexandre Miquel The Implicit Calculus of Constructions. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:344-359 [Conf ] 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 ] Vincent Padovani Retracts in Simple Types. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:376-384 [Conf ] 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 ] Aleksy Schubert The Complexity of beta-Reduction in Low Orders. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:400-414 [Conf ] Christian Urban Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. [Citation Graph (0, 0)][DBLP ] TLCA, 2001, pp:415-430 [Conf ]