The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Jean-Marc Andreoli
    The Coordination Language Facility and Applications. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:1-5 [Conf]
  2. Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte
    AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:6-13 [Conf]
  3. V. Michele Abrusci
    Modules in Non-communicative Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:14-24 [Conf]
  4. Patrick Baillot, Marco Pedicini
    Elementary Complexity and Geometry of Interaction. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:25-39 [Conf]
  5. Nuno Barreiro, Thomas Ehrhard
    Quantitative Semantics Revisited. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:40-53 [Conf]
  6. Stefano Berardi, Ugo de'Liguoro
    Total Functionals and Well-Founded Strategies. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:54-68 [Conf]
  7. Sabine Broda, Luís Damas
    Counting a Type's Principal Inhabitants. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:69-82 [Conf]
  8. Ferruccio Damiani
    Useless-Code Detection and Elimination for PCF with Algebraic Data types. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:83-97 [Conf]
  9. René David
    Every Unsolvable lambda Term has a Decoration. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:98-113 [Conf]
  10. Pietro Di Gianantonio, Gianluca Franco, Furio Honsell
    Game Semantics for Untyped lambda beta eta-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:114-128 [Conf]
  11. Peter Dybjer, Anton Setzer
    A Finite Axiomatization of Inductive-Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:129-146 [Conf]
  12. Marcelo P. Fiore, Alex K. Simpson
    Lambda Definability with Sums via Grothendieck Logical Relations. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:147-161 [Conf]
  13. Ken-etsu Fujita
    Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:162-176 [Conf]
  14. Healfdene Goguen
    Soundness of the Logical Framework for Its Typed Operational Semantics. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:177-197 [Conf]
  15. Masahito Hasegawa
    Logical Predicates for Intuitionistic Linear Type Theories. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:198-212 [Conf]
  16. Olivier Laurent
    Polarized Proof-Nets: Proof-Nets for LC. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:213-227 [Conf]
  17. Paul Blain Levy
    Call-by-Push-Value: A Subsuming Paradigm. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:228-242 [Conf]
  18. Seikoh Mikami, Yohji Akama
    A Study of Abramsky's Linear Chemical Abstract Machine. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:243-257 [Conf]
  19. Peter W. O'Hearn
    Resource Interpretations, Bunched Implications and the alpha lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:258-279 [Conf]
  20. Atsushi Ohori
    A Curry-Howard Isomorphism for Compilation and Program Execution. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:280-294 [Conf]
  21. Jeff Polakow, Frank Pfenning
    Natural Deduction for Intuitionistic Non-communicative Linear Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:295-309 [Conf]
  22. Erik Poll, Jan Zwanenburg
    A Logic for Abstract Data Types as Existential Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:310-324 [Conf]
  23. Eike Ritter
    Characterising Explicit Substitutions which Preserve Termination. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:325-339 [Conf]
  24. Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
    Explicit Environments. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:340-354 [Conf]
  25. Richard Statman
    Consequences of Jacopini's Theorem: Consistent Equalities and Equations. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:355-364 [Conf]
  26. Christian Urban, Gavin M. Bierman
    Strong Normalisation of Cut-Elimination in Classical Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:365-380 [Conf]
  27. Jan Zwanenburg
    Pure Type Systems with Subtyping. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:381-396 [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