Journals in DBLP

Electr. Notes Theor. Comput. Sci.
2000, volume: 35, number:

1. Andrej Bauer
   Equilogical spaces and domains with totality. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
2. Karl-Heinz Niggl
   Characterizing polytime through higher type recursion. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
3. Dag Normann
   The Cook-Berger problem - A guide to the solution. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
4. Dag Normann
   The continuous functionals of finite types over the reals. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
5. Jaap van Oosten, Alex K. Simpson
   Some axiomatic results in synthetic domain theory. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
6. Victor J. Pollara
   Free SFP-algebras for truncation-closed sets of inequations. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
7. Holger Schulz
   Type two theory of effectivity and Real PCF. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
8. Giovanni Sambin
   Formal topology and domains. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
9. Dana S. Scott
   Effective versions of equilogical spaces. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
   
10. Werner Struckmann
    A general theorem on the total correctness of programs in a category. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
11. Dieter Spreen
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
12. Michael Marz
    A fully abstract model for sequential computation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
13. John Longley
    Matching typed and untyped realizability. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
14. Dominique Larchey-Wendling, Didier Galmiche
    Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
15. Stefano Berardi, Chantal Berline
    Building continuous webbed models for system F. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
16. Rudolf Berghammer
    Soundness of a purely syntactical formalizationof weakest preconditions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
17. Lars Birkedal
    On propositions-as-types in realizability models. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
18. Regina Tix
    Convex power constructions for continuous d-cones. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
19. Giovanni Curi
    Formal topologies with weight and distance - A predicative framework for analysis. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
20. Thomas Ehrhard
    A relative PCF-definability result for strongly stable functions and some corollaries. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
21. Birgit Elbl
    Justifying control for logic programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
22. Yuri Leonidovich Ershov
    Sigma predicates of finite types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
23. Jürgen Koslowski
    Strategies for games with state - An application of the Chu-construction. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
24. Hans-Peter A. Künzi, Michel P. Schellekens
    The ideal completion is not sequentially adequate. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
    
25. Pierre Valarcher
    Intensional semantics of system T of Gödel. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]