The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2002, volume: 272, number: 1-2

  1. Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi
    Theories of Types and Proofs 1997 - Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:1-2 [Journal]
  2. Steffen van Bakel, Franco Barbanera, Mariangiola Dezani-Ciancaglini, Fer-Jan de Vries
    Intersection types for lambda-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:3-40 [Journal]
  3. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
    Inductive-data-type systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:41-68 [Journal]
  4. Mario Coppo, Ferruccio Damiani, Paola Giannini
    Strictness, totality, and non-standard-type inference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:69-112 [Journal]
  5. Ryu Hasegawa
    Two applications of analytic functors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:113-175 [Journal]
  6. Susumu Hayashi, Ryosuke Sumitomo, Ken-ichiro Shii
    Towards the animation of proofs - testing proofs by examples. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:177-195 [Journal]
  7. Hajime Ishihara, Toshihiko Kurata
    Completeness of intersection and union type assignment systems for call-by-value lambda-models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:197-221 [Journal]
  8. Yukiyoshi Kameyama, Masahiko Sato
    Strong normalizability of the non-deterministic catch/throw calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:223-245 [Journal]
  9. Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
    Innocent game models of untyped lambda-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:247-292 [Journal]
  10. Martijn Oostdijk, Herman Geuvers
    Proof by computation in the Coq system. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:293-314 [Journal]
  11. Tarmo Uustalu, Varmo Vene
    Least and greatest fixed points in intuitionistic natural deduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:315-339 [Journal]
  12. Hirofumi Yokouchi
    Completeness of type assignment systems with intersection, union, and type quantifiers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:341-398 [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