The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1993, volume: 121, number: 1&2

  1. Martín Abadi, Luca Cardelli, Pierre-Louis Curien
    Formal Parametric Polymorphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:9-58 [Journal]
  2. Henk Barendregt
    Constructive Proofs of the Range Property in lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:59-69 [Journal]
  3. Alessandro Berarducci, Benedetto Intrigila
    Some New Results on Easy lambda-Terms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:71-88 [Journal]
  4. Robert L. Constable, Scott F. Smith
    Computational Foundations of Basic Recursive Function Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:89-112 [Journal]
  5. Mario Coppo, Alberto Ferrari
    Type Inference, Abstract Interpretation and Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:113-143 [Journal]
  6. Gérard P. Huet
    An Analysis of Böhm's Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:145-167 [Journal]
  7. G. Jacopini, G. Sontacchi
    General Recursive Functions in a Very Simply Interpretable Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:169-178 [Journal]
  8. Stephen D. Brookes
    Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:179-186 [Journal]
  9. Gilles Kahn, Gordon D. Plotkin
    Concrete Domains. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:187-277 [Journal]
  10. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
    Combinatory Reduction Systems: Introduction and Survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:279-308 [Journal]
  11. Daniel Leivant
    Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:309-322 [Journal]
  12. Giuseppe Longo, Kathleen Milsted, Sergei Soloviev
    The Genericity Theorem and Parametricity in the Polymorphic lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:323-349 [Journal]
  13. Gordon D. Plotkin
    Set-Theoretical and Other Elementary Models of the lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:351-409 [Journal]
  14. Dana S. Scott
    A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:411-440 [Journal]
  15. Richard Statman
    Some Examples of Non-Existent Combinators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:441-448 [Journal]
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