| 2007 |
|---|
| 36 | EE | Thomas Streicher,
Ulrich Kohlenbach:
Shoenfield is Gödel after Krivine.
Math. Log. Q. 53(2): 176-179 (2007) |
| 2006 |
|---|
| 35 | EE | Tobias Löw,
Thomas Streicher:
Universality Results for Models in Locally Boolean Domains.
CSL 2006: 456-470 |
| 34 | EE | Martin Hofmann,
Jaap van Oosten,
Thomas Streicher:
Well-foundedness in Realizability.
Arch. Math. Log. 45(7): 795-805 (2006) |
| 2005 |
|---|
| 33 | EE | Bernhard Reus,
Thomas Streicher:
About Hoare Logics for Higher-Order Store.
ICALP 2005: 1337-1348 |
| 2004 |
|---|
| 32 | EE | Martín Hötzel Escardó,
Martin Hofmann,
Thomas Streicher:
On the non-sequential nature of the interval-domain model of real-number computation.
Mathematical Structures in Computer Science 14(6): 803-814 (2004) |
| 31 | EE | Bernhard Reus,
Thomas Streicher:
Semantics and logic of object calculi.
Theor. Comput. Sci. 316(1): 191-213 (2004) |
| 2002 |
|---|
| 30 | EE | Bernhard Reus,
Thomas Streicher:
Semantics and Logic of Object Calculi.
LICS 2002: 113- |
| 29 | EE | Martin Hofmann,
Thomas Streicher:
Completeness of Continuation Models for lambda-mu-Calculus.
Inf. Comput. 179(2): 332-355 (2002) |
| 28 | EE | Martín Hötzel Escardó,
Thomas Streicher:
In Domain Realizability, not all Functionals on C[-1, 1] are Continuous.
Math. Log. Q. 48(S1): 41-44 (2002) |
| 27 | | Peter Lietz,
Thomas Streicher:
Impredicativity entails Untypedness.
Mathematical Structures in Computer Science 12(3): 335-347 (2002) |
| 2000 |
|---|
| 26 | | Thomas Streicher:
Review: Practical Foundations of Mathematics - Paul Taylor, Cambridge Studies in Advanced Mathematics, Vol. 59, Cambridge University Press, Cambridge, 1999. xi+572 pages, price £50 paperback, ISBN 0-521-63107-6.
Sci. Comput. Program. 38(1-3): 155-157 (2000) |
| 1999 |
|---|
| 25 | EE | Michael Marz,
Alexander Rohr,
Thomas Streicher:
Full Abstraction and Universality via Realisability.
LICS 1999: 174-182 |
| 24 | EE | Giuseppe Rosolini,
Thomas Streicher:
Comparing models of higher type computation.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 23 | EE | Thomas Streicher:
Denotational Completeness Revisited.
Electr. Notes Theor. Comput. Sci. 29: (1999) |
| 22 | | Bernhard Reus,
Thomas Streicher:
General synthetic domain theory - a logical approach.
Mathematical Structures in Computer Science 9(2): 177-223 (1999) |
| 21 | EE | Martín Hötzel Escardó,
Thomas Streicher:
Induction and Recursion on the Partial Real Line with Applications to Real PCF.
Theor. Comput. Sci. 210(1): 121-157 (1999) |
| 1998 |
|---|
| 20 | | Thomas Streicher,
Bernhard Reus:
Classical Logic, Continuation Semantics and Abstract Machines.
J. Funct. Program. 8(6): 543-572 (1998) |
| 1997 |
|---|
| 19 | | Bernhard Reus,
Thomas Streicher:
General Synthetic Domain Theory - A Logical Approach.
Category Theory and Computer Science 1997: 293-313 |
| 18 | EE | Martín Hötzel Escardó,
Thomas Streicher:
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras.
LICS 1997: 376-386 |
| 17 | EE | Martin Hofmann,
Thomas Streicher:
Continuation Models are Universal for Lambda-Mu-Calculus.
LICS 1997: 387-395 |
| 1996 |
|---|
| 16 | | Thorsten Altenkirch,
Martin Hofmann,
Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System.
ISTCS 1996: 146 |
| 15 | | Thorsten Altenkirch,
Martin Hofmann,
Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System.
LICS 1996: 98-106 |
| 1995 |
|---|
| 14 | | Thorsten Altenkirch,
Martin Hofmann,
Thomas Streicher:
Categorical Reconstruction of a Reduction Free Normalization Proof.
Category Theory and Computer Science 1995: 182-199 |
| 1994 |
|---|
| 13 | | Andy Mück,
Thomas Streicher:
A Tiny Constrain Functional Logic Language and Its Continuation Semantics.
ESOP 1994: 439-453 |
| 12 | | Martin Hofmann,
Thomas Streicher:
The Groupoid Model Refutes Uniqueness of Identity Proofs
LICS 1994: 208-212 |
| 11 | | Thomas Streicher:
A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists.
Mathematical Structures in Computer Science 4(1): 111-115 (1994) |
| 1993 |
|---|
| 10 | | Bernhard Reus,
Thomas Streicher:
Verifying Properties of Module Construction in Type Theory.
MFCS 1993: 660-670 |
| 1992 |
|---|
| 9 | | Manfred Broy,
Thomas Streicher:
Modular functional modelling of Petri nets with individual tokens.
Advances in Petri Nets: The DEMON Project 1992: 70-88 |
| 8 | | Thomas Streicher:
Dependence and Independence Results for (Impredicative) Calculi of Dependent Types.
Mathematical Structures in Computer Science 2(1): 29-54 (1992) |
| 7 | | Thomas Streicher:
Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions.
Theor. Comput. Sci. 103(2): 395-408 (1992) |
| 1991 |
|---|
| 6 | | Bart Jacobs,
Eugenio Moggi,
Thomas Streicher:
Relating Models of Impredicative Type Theories.
Category Theory and Computer Science 1991: 197-218 |
| 5 | | Yves Lafont,
Thomas Streicher:
Games Semantics for Linear Logic
LICS 1991: 43-50 |
| 1990 |
|---|
| 4 | | Thomas Streicher,
Martin Wirsing:
Dependent Types Considered Necessary for Specification Languages.
ADT 1990: 323-340 |
| 1989 |
|---|
| 3 | | Thomas Streicher:
Independence Results for Calculi of Dependent Types.
Category Theory and Computer Science 1989: 141-154 |
| 1986 |
|---|
| 2 | | Manfred Broy,
Thomas Streicher:
Views of Distributed Systems.
Mathematical Models for the Semantics of Parallelism 1986: 114-143 |
| 1984 |
|---|
| 1 | | Thomas Streicher:
Model Theory of Denotational Semantics.
ADT 1984: 240-253 |
