nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fully abstract model for sequential computation☆ ☆ This paper is an extended abstract of a major part of my PhD thesis. It contains all important results of a technical report that I wrote during a one year stay at the University of Birmingham, however, most of the proofs and many details are omitted. For a more detailed version please look at [8].
|
Marz, Michael |
|
2000 |
35 |
C |
p. 133-152 20 p. |
artikel |
2 |
A general theorem on the total correctness of programs in a category
|
Struckmann, Werner |
|
2000 |
35 |
C |
p. 205- 1 p. |
artikel |
3 |
A relative PCF-definability result for strongly stable functions and some corollaries (Extended abstract)☆ ☆ The results presented in this extended abstract have already been published in Information and Computation, under the same title. From this original article [10], we have kept all the informal discussions, the statements of the main results as well as those of the intermediate lemmas, but most proofs have been suppressed.
|
Ehrhard, Thomas |
|
2000 |
35 |
C |
p. 64-83 20 p. |
artikel |
4 |
Building continuous webbed models for system F
|
Berardi, S. |
|
2000 |
35 |
C |
p. 3-33 31 p. |
artikel |
5 |
Characterizing polytime through higher type recursion
|
Niggl, Karl-Heinz |
|
2000 |
35 |
C |
p. 153- 1 p. |
artikel |
6 |
Convex Power Constructions for Continuous D-Cones
|
Tix, Regina |
|
2000 |
35 |
C |
p. 206-229 24 p. |
artikel |
7 |
Effective versions of equilogical spaces
|
Scott, Dana |
|
2000 |
35 |
C |
p. 204- 1 p. |
artikel |
8 |
Equilogical spaces and domains with totality
|
Bauer, Andrej |
|
2000 |
35 |
C |
p. 2- 1 p. |
artikel |
9 |
FOCS - functorial ordered computing structures
|
Nourani, Cyrus F. |
|
2000 |
35 |
C |
p. 174- 1 p. |
artikel |
10 |
Formal Topology and Domains
|
Sambin, Giovanni |
|
2000 |
35 |
C |
p. 177-190 14 p. |
artikel |
11 |
Free SFP-algebras for truncation-closed sets of inequations
|
Pollara, Victor J. |
|
2000 |
35 |
C |
p. 176- 1 p. |
artikel |
12 |
Intensional Semantics of System T of Gödel
|
Valarcher, Pierre |
|
2000 |
35 |
C |
p. 230-243 14 p. |
artikel |
13 |
Justifying control for logic programs
|
Elbl, Birgit |
|
2000 |
35 |
C |
p. 84- 1 p. |
artikel |
14 |
Matching typed and untyped readability (Extended abstract)
|
Longley, John |
|
2000 |
35 |
C |
p. 109-132 24 p. |
artikel |
15 |
Metric spaces in type theory via formal topology (Extended Abstract)
|
Curi, Giovanni |
|
2000 |
35 |
C |
p. 53-63 11 p. |
artikel |
16 |
On propositions-as-types in realizability models
|
Birkedal, Lars |
|
2000 |
35 |
C |
p. 52- 1 p. |
artikel |
17 |
Preface
|
Spreen, Dieter |
|
2000 |
35 |
C |
p. 1- 1 p. |
artikel |
18 |
Quantales as completions of ordered monoids: Revised semantics for Intuitionistic Linear Logic
|
Larchey-Wendling, D. |
|
2000 |
35 |
C |
p. 94-108 15 p. |
artikel |
19 |
Sigma predicates of finite types
|
Ershov, Y.L. |
|
2000 |
35 |
C |
p. 85- 1 p. |
artikel |
20 |
Some axiomatic results in synthetic domain theory
|
van Oosten, A.K. |
|
2000 |
35 |
C |
p. 175- 1 p. |
artikel |
21 |
Soundness of a purely syntactical formalization of weakest preconditions
|
Berghammer, Rudolf |
|
2000 |
35 |
C |
p. 34-51 18 p. |
artikel |
22 |
Strategies for games with state
|
Koslowski, Jürgen |
|
2000 |
35 |
C |
p. 86- 1 p. |
artikel |
23 |
The Continuous Functionals of Finite Types Over the Reals
|
Normann, Dag |
|
2000 |
35 |
C |
p. 163-173 11 p. |
artikel |
24 |
The Cook-Berger problem -A guide to the solution
|
Normann, Dag |
|
2000 |
35 |
C |
p. 154-162 9 p. |
artikel |
25 |
The ideal completion is not sequentially adequate
|
Künzi, H.P. |
|
2000 |
35 |
C |
p. 87-93 7 p. |
artikel |
26 |
Type Two Theory of Effectivity and Real PCF
|
Schulz, Holger |
|
2000 |
35 |
C |
p. 191-203 13 p. |
artikel |