The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1995, volume: 139, number: 1&2

  1. Ian M. Hodkinson
    On Gabbay's Temporal Fixed Point Operator. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:1-25 [Journal]
  2. Peter Päppinghaus
    On the Logic of UNITY. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:27-67 [Journal]
  3. J. Robin B. Cockett, Dwight Spencer
    Strong Categorical Datatypes II: A Term Logic for Categorical Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:69-113 [Journal]
  4. Michael Barr
    Nonsymmetric *-Autonomous Categories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:115-130 [Journal]
  5. Giorgio Ghelli
    Divergence of F< Type Checking. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:131-162 [Journal]
  6. Anne Bergeron
    Sharing Out Control in Distributed Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:163-186 [Journal]
  7. Pasquale Malacaria
    Studying Equivalences of Transition Systems with Algebraic Tools. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:187-205 [Journal]
  8. Daniel J. Dougherty, Patricia Johann
    A Combinatory Logic Approach to Higher-Order E-Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:207-242 [Journal]
  9. Yiannis N. Moschovakis
    Computable Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:243-273 [Journal]
  10. Gilles Bernot, Michel Bidoit, Teodor Knapik
    Observational Specifications and the Indistinguishability Assumption. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:275-314 [Journal]
  11. Paola Inverardi, Monica Nesi
    Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:315-354 [Journal]
  12. Andreas Weiermann
    Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:355-362 [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