Electronic Notes in Theoretical Computer Science, Volume 35

Volume 35, 2000

Workshop on Domains IV
Rolandseck, Germany, 2-4 October 1998

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