Electronic Notes in Theoretical Computer Science, Volume 35

Volume 35, 2000

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