Volume 35, 2000
Rolandseck, Germany, 2-4 October 1998
Dieter Spreen: Preface. 1- Andrej Bauer: Equilogical spaces and domains with totality. 2
- Rudolf Berghammer: Soundness of a purely syntactical formalizationof weakest preconditions. 34-51
- Lars Birkedal: On propositions-as-types in realizability models. 52
- Giovanni Curi: Metric spaces in type theory via formal topology. 53-63
- Thomas Ehrhard: A relative PCF-definability result for strongly stable functions and some corollaries. 64-83
- Birgit Elbl: Justifying control for logic programs. 84
- Yuri Leonidovich Ershov: Sigma predicates of finite types. 85
- Jürgen Koslowski: Strategies for games with state - An application of the Chu-construction. 86
- Hans-Peter A. Künzi, Michel P. Schellekens: The ideal completion is not sequentially adequate. 87-93
- Dominique Larchey-Wendling, Didier Galmiche: Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. 94-108
- John Longley: Matching typed and untyped realizability. 109-132
- Michael Marz: A fully abstract model for sequential computation. 133-152
- Karl-Heinz Niggl: Characterizing polytime through higher type recursion. 153
- Dag Normann: The Cook-Berger problem - A guide to the solution. 154-162
- Dag Normann: The continuous functionals of finite types over the reals. 163-173
- Victor J. Pollara: Free SFP-algebras for truncation-closed sets of inequations. 176
- Giovanni Sambin: Formal topology and domains. 177-190
- Holger Schulz: Type two theory of effectivity and Real PCF. 191-203
- Dana S. Scott: Effective versions of equilogical spaces. 204
- Werner Struckmann: A general theorem on the total correctness of programs in a category. 205
- Regina Tix: Convex power constructions for continuous d-cones. 206-229
- Pierre Valarcher: Intensional semantics of system T of Gödel. 230-243
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team