The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Yohji Akama
    On Mints' Reduction for ccc-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:1-12 [Conf]
  2. Thorsten Altenkirch
    A Formalization of the Strong Normalization Proof for System F in LEGO. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:13-28 [Conf]
  3. Steffen van Bakel
    Partial Intersection Type Assignment in Applicative Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:29-44 [Conf]
  4. Franco Barbanera, Stefano Berardi
    Extracting Constructive Content from Classical Logic via Control-like Reductions. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:45-59 [Conf]
  5. Franco Barbanera, Maribel Fernández
    Combining First and Higher Order Rewrite Systems with Type Assignment Systems. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:60-74 [Conf]
  6. P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland
    A Term Calculus for Intuitionistic Linear Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:75-90 [Conf]
  7. Ulrich Berger
    Program Extraction from Normalization Proofs. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:91-106 [Conf]
  8. Giuseppe Castagna, Giorgio Ghelli, Giuseppe Longo
    A Semantics for Lambda&-early: A Calculus with Overloading and Early Binding. [Citation Graph (1, 0)][DBLP]
    TLCA, 1993, pp:107-123 [Conf]
  9. Pietro Di Gianantonio, Furio Honsell
    An Abstract Notion of Application. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:124-138 [Conf]
  10. Gilles Dowek
    The Undecidability of Typability in the Lambda-Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:139-145 [Conf]
  11. Giorgio Ghelli
    Recursive Types Are not Conservative over F. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:146-162 [Conf]
  12. Philippe de Groote
    The Conservation Theorem revisited. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:163-178 [Conf]
  13. J. M. E. Hyland, C.-H. Luke Ong
    Modified Realizability Toposes and Strong Normalization Proofs. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:179-194 [Conf]
  14. Bart Jacobs
    Semantics of lambda-I and of other substructure lambda calculi. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:195-208 [Conf]
  15. Bart Jacobs, Thomas F. Melham
    Translating Dependent Type Theory into Higher Order Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:209-229 [Conf]
  16. Achim Jung, Allen Stoughton
    Studying the Fully Abstract Model of PCF within its Continuous Function Model. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:230-244 [Conf]
  17. Achim Jung, Jerzy Tiuryn
    A New Characterization of Lambda Definability. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:245-257 [Conf]
  18. Hans Leiß
    Combining Recursive and Dynamic Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:258-273 [Conf]
  19. Daniel Leivant, Jean-Yves Marion
    Lambda calculus characterizations of poly-time. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:274-288 [Conf]
  20. James McKinna, Robert Pollack
    Pure Type Systems Formalized. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:289-305 [Conf]
  21. Tobias Nipkow
    Orthogonal Higher-Order Rewrite Systems are Confluent. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:306-317 [Conf]
  22. Daniel F. Otth
    Monotonic versus Antimonotonic Exponentation. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:318-327 [Conf]
  23. Christine Paulin-Mohring
    Inductive Definitions in the system Coq - Rules and Properties. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:328-345 [Conf]
  24. Benjamin C. Pierce
    Intersection Types and Bounded Polymorphism. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:346-360 [Conf]
  25. Gordon D. Plotkin, Martín Abadi
    A Logic for Parametric Polymorphism. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:361-375 [Conf]
  26. Kurt Sieber
    Call-by-Value and Nondeterminism. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:376-390 [Conf]
  27. Jan Springintveld
    Lower and Upper Bounds for Reductions of Types in Lambda-omega and Lambda-P. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:391-405 [Conf]
  28. Masako Takahashi
    Lambda-Calculi with Conditional Rules. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:406-417 [Conf]
  29. Pawel Urzyczyn
    Type reconstruction in F-omega is undecidable. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:418-432 [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