Model Theory of Denotational Semantics. - Thomas Streicher (ADT, 1984)

Views of Distributed Systems. - Manfred Broy; Thomas Streicher (Mathematical Models for the Semantics of Parallelism, 1986)

Independence Results for Calculi of Dependent Types. - Thomas Streicher (Category Theory and Computer Science, 1989)

Correctness and completeness of a categorical semantics of the calculus of constructions. - Thomas Streicher (1989)

Dependent Types Considered Necessary for Specification Languages. - Thomas Streicher; Martin Wirsing (ADT, 1990)

Modular functional modelling of Petri nets with individual tokems - Manfred Broy; Thomas Streicher (Forschungsberichte, TU Munich, 1990)

Semantics of type theory - correctness, completeness and independence results. - Thomas Streicher (Birkhäuser, 1991)

Relating Models of Impredicative Type Theories. - Bart Jacobs 001; Eugenio Moggi; Thomas Streicher (Category Theory and Computer Science, 1991)

Games Semantics for Linear Logic - Yves Lafont; Thomas Streicher (LICS, 1991)

Specification and design of shared resource arbitration. - Manfred Broy; Thomas Streicher (Int. J. Parallel Program., 1991)

Modular functional modelling of Petri nets with individual tokens. - Manfred Broy; Thomas Streicher (Advances in Petri Nets: The DEMON Project, 1992)

Dependence and Independence Results for (Impredicative) Calculi of Dependent Types. - Thomas Streicher (Math. Struct. Comput. Sci., 1992)

Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions. - Thomas Streicher (Theor. Comput. Sci., 1992)

Verifying Properties of Module Construction in Type Theory. - Bernhard Reus; Thomas Streicher (MFCS, 1993)

A Tiny Constrain Functional Logic Language and Its Continuation Semantics. - Andy Mück; Thomas Streicher (ESOP, 1994)

The Groupoid Model Refutes Uniqueness of Identity Proofs - Martin Hofmann 001; Thomas Streicher (LICS, 1994)

A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists. - Thomas Streicher (Math. Struct. Comput. Sci., 1994)

Categorical Reconstruction of a Reduction Free Normalization Proof. - Thorsten Altenkirch; Martin Hofmann 001; Thomas Streicher (Category Theory and Computer Science, 1995)

Reduction-Free Normalisation for a Polymorphic System. - Thorsten Altenkirch; Martin Hofmann 001; Thomas Streicher (ISTCS, 1996)

Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. - Martín Hötzel Escardó; Thomas Streicher (LICS, 1997)

Continuation Models are Universal for Lambda-Mu-Calculus. - Martin Hofmann 001; Thomas Streicher (LICS, 1997)

Classical Logic, Continuation Semantics and Abstract Machines. - Thomas Streicher; Bernhard Reus (J. Funct. Program., 1998)

Full Abstraction and Universality via Realisability. - Michael Marz; Alexander Rohr; Thomas Streicher (LICS, 1999)

Inductive Construction of Repletion. - Thomas Streicher (Appl. Categorical Struct., 1999)

Comparing models of higher type computation. - Giuseppe Rosolini; Thomas Streicher (Realizability Semantics and Applications@FLoC, 1999)

General synthetic domain theory - a logical approach. - Bernhard Reus; Thomas Streicher (Math. Struct. Comput. Sci., 1999)

Induction and Recursion on the Partial Real Line with Applications to Real PCF. - Martín Hötzel Escardó; Thomas Streicher (Theor. Comput. Sci., 1999)

Denotational Completeness Revisited. - Thomas Streicher (CTCS, 1999)

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. - Thomas Streicher (Sci. Comput. Program., 2000)

Completeness of Continuation Models for lambda-mu-Calculus. - Martin Hofmann 001; Thomas Streicher (Inf. Comput., 2002)

In Domain Realizability, not all Functionals on C[-1, 1] are Continuous. - Martín Hötzel Escardó; Thomas Streicher (Math. Log. Q., 2002)

Impredicativity entails Untypedness. - Peter Lietz; Thomas Streicher (Math. Struct. Comput. Sci., 2002)

On the non-sequential nature of the interval-domain model of real-number computation. - Martín Hötzel Escardó; Martin Hofmann 001; Thomas Streicher (Math. Struct. Comput. Sci., 2004)

Semantics and logic of object calculi. - Bernhard Reus; Thomas Streicher (Theor. Comput. Sci., 2004)

Universes in Toposes. - Thomas Streicher (From sets and types to topology and analysis, 2005)

About Hoare Logics for Higher-Order Store. - Bernhard Reus; Thomas Streicher (ICALP, 2005)

Domain-theoretic foundations of functional programming. - Thomas Streicher (World Scientific, 2006)

Universality Results for Models in Locally Boolean Domains. - Tobias Löw; Thomas Streicher (CSL, 2006)

Well-foundedness in Realizability. - Martin Hofmann 001; Jaap van Oosten; Thomas Streicher (Arch. Math. Log., 2006)

Preface. - Martín Hötzel Escardó; Achim Jung; Thomas Streicher (Math. Struct. Comput. Sci., 2006)

Quotients of countably based spaces are not closed under sobrification. - Gary Gruenhage; Thomas Streicher (Math. Struct. Comput. Sci., 2006)

Relating First-order Set Theories and Elementary Toposes. - Steven Awodey; Carsten Butz; Alex Simpson; Thomas Streicher (Bull. Symb. Log., 2007)

Shoenfield is Gödel after Krivine. - Thomas Streicher; Ulrich Kohlenbach (Math. Log. Q., 2007)

On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic. - Paulo Oliva; Thomas Streicher (Fundam. Informaticae, 2008)

A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language. - Klaus Keimel; Artus Ph. Rosenbusch; Thomas Streicher (Ann. Pure Appl. Log., 2009)

Preface for the special issue on domains. - Bernhard Reus; Achim Jung; Klaus Keimel; Thomas Streicher (Math. Struct. Comput. Sci., 2010)

Relative Completeness for Logics of Functional Programs. - Bernhard Reus; Thomas Streicher (CSL, 2011)

Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language. - Klaus Keimel; Artus Ph. Rosenbusch; Thomas Streicher (Theor. Comput. Sci., 2011)

Realizability models refuting Ishihara's boundedness principle. - Peter Lietz; Thomas Streicher (Ann. Pure Appl. Log., 2012)

A synthetic theory of sequential domains. - Bernhard Reus; Thomas Streicher (Ann. Pure Appl. Log., 2012)

Constructive toposes with countable sums as models of constructive set theory. - Alex K. Simpson; Thomas Streicher (Ann. Pure Appl. Log., 2012)

Krivine's classical realisability from a categorical perspective. - Thomas Streicher (Math. Struct. Comput. Sci., 2013)

Relating first-order set theories, toposes and categories of classes. - Steven Awodey; Carsten Butz; Alex Simpson; Thomas Streicher (Ann. Pure Appl. Log., 2014)

Observationally-induced algebras in Domain Theory. - Ingo Battenfeld; Klaus Keimel; Thomas Streicher (Log. Methods Comput. Sci., 2014)

A model of type theory in simplicial sets: A brief introduction to Voevodsky's homotopy type theory. - Thomas Streicher (J. Appl. Log., 2014)

Models of intuitionistic set theory in subtoposes of nested realizability toposes. - Samuele Maschio; Thomas Streicher (Ann. Pure Appl. Log., 2015)

The intrinsic topology of Martin-Löf universes. - Martín Hötzel Escardó; Thomas Streicher (Ann. Pure Appl. Log., 2016)

Computability in Basic Quantum Mechanics. - Martin Pape; Thomas Streicher (CoRR, 2016)

A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus. - Thomas Streicher (Log. Methods Comput. Sci., 2017)

Consistency of the intensional level of the Minimalist Foundation with Church's thesis and axiom of choice. - Hajime Ishihara; Maria Emilia Maietti; Samuele Maschio; Thomas Streicher (Arch. Math. Log., 2018)

Computability in Basic Quantum Mechanics. - Eike Neumann; Martin Pape; Thomas Streicher (Log. Methods Comput. Sci., 2018)

Triposes as a generalization of localic geometric morphisms. - Jonas Frey; Thomas Streicher (Math. Struct. Comput. Sci., 2021)

The genesis of the groupoid model. - Thomas Streicher (Math. Struct. Comput. Sci., 2021)