Thomas Streicher

ORCID

Publication Activity (10 Years)

Years Active: 1984-2021
Publications (10 Years): 7

Top Venues

Math. Struct. Comput. Sci.

Ann. Pure Appl. Log.

Log. Methods Comput. Sci.

CoRR

University of Passau, Germany (PHD)

Education History

University of Passau, Germany

PHD

Publications

Thomas Streicher
The genesis of the groupoid model. Math. Struct. Comput. Sci. 31 (9) (2021)
Jonas Frey, Thomas Streicher
Triposes as a generalization of localic geometric morphisms. Math. Struct. Comput. Sci. 31 (9) (2021)
Eike Neumann, Martin Pape, Thomas Streicher
Computability in Basic Quantum Mechanics. Log. Methods Comput. Sci. 14 (2) (2018)
Hajime Ishihara, Maria Emilia Maietti, Samuele Maschio, Thomas Streicher
Consistency of the intensional level of the Minimalist Foundation with Church's thesis and axiom of choice. Arch. Math. Log. 57 (7-8) (2018)
Thomas Streicher
A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus. Log. Methods Comput. Sci. 13 (4) (2017)
Martin Pape, Thomas Streicher
Computability in Basic Quantum Mechanics. CoRR (2016)
Martín Hötzel Escardó, Thomas Streicher
The intrinsic topology of Martin-Löf universes. Ann. Pure Appl. Log. 167 (9) (2016)
Samuele Maschio, Thomas Streicher
Models of intuitionistic set theory in subtoposes of nested realizability toposes. Ann. Pure Appl. Log. 166 (6) (2015)
Steven Awodey, Carsten Butz, Alex Simpson, Thomas Streicher
Relating first-order set theories, toposes and categories of classes. Ann. Pure Appl. Log. 165 (2) (2014)
Thomas Streicher
A model of type theory in simplicial sets: A brief introduction to Voevodsky's homotopy type theory. J. Appl. Log. 12 (1) (2014)
Ingo Battenfeld, Klaus Keimel, Thomas Streicher
Observationally-induced algebras in Domain Theory. Log. Methods Comput. Sci. 10 (3) (2014)
Thomas Streicher
Krivine's classical realisability from a categorical perspective. Math. Struct. Comput. Sci. 23 (6) (2013)
Bernhard Reus, Thomas Streicher
A synthetic theory of sequential domains. Ann. Pure Appl. Log. 163 (8) (2012)
Peter Lietz, Thomas Streicher
Realizability models refuting Ishihara's boundedness principle. Ann. Pure Appl. Log. 163 (12) (2012)
Alex K. Simpson, Thomas Streicher
Constructive toposes with countable sums as models of constructive set theory. Ann. Pure Appl. Log. 163 (10) (2012)
Bernhard Reus, Thomas Streicher
Relative Completeness for Logics of Functional Programs. CSL (2011)
Klaus Keimel, A. Rosenbusch, Thomas Streicher
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language. Theor. Comput. Sci. 412 (25) (2011)
Bernhard Reus, Achim Jung, Klaus Keimel, Thomas Streicher
Preface for the special issue on domains. Math. Struct. Comput. Sci. 20 (2) (2010)
Klaus Keimel, A. Rosenbusch, Thomas Streicher
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language. Ann. Pure Appl. Log. 159 (3) (2009)
Paulo Oliva, Thomas Streicher
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic. Fundam. Informaticae 84 (2) (2008)
Martín Hötzel Escardó, Achim Jung, Thomas Streicher
Preface. Math. Struct. Comput. Sci. 17 (5) (2007)
Thomas Streicher, Ulrich Kohlenbach
Shoenfield is Gödel after Krivine. Math. Log. Q. 53 (2) (2007)
Steven Awodey, Carsten Butz, Alex Simpson, Thomas Streicher
Relating First-order Set Theories and Elementary Toposes. Bull. Symb. Log. 13 (3) (2007)
Gary Gruenhage, Thomas Streicher
Quotients of countably based spaces are not closed under sobrification. Math. Struct. Comput. Sci. 16 (2) (2006)
Martin Hofmann, Jaap van Oosten, Thomas Streicher
Well-foundedness in Realizability. Arch. Math. Log. 45 (7) (2006)
Martín Hötzel Escardó, Achim Jung, Thomas Streicher
Preface. Math. Struct. Comput. Sci. 16 (2) (2006)
Tobias Löw, Thomas Streicher
Universality Results for Models in Locally Boolean Domains. CSL (2006)
Bernhard Reus, Thomas Streicher
About Hoare Logics for Higher-Order Store. ICALP (2005)
Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher
On the non-sequential nature of the interval-domain model of real-number computation. Math. Struct. Comput. Sci. 14 (6) (2004)
Bernhard Reus, Thomas Streicher
Semantics and logic of object calculi. Theor. Comput. Sci. 316 (1) (2004)
Bernhard Reus, Thomas Streicher
Semantics and Logic of Object Calculi. LICS (2002)
Martin Hofmann, Thomas Streicher
Completeness of Continuation Models for lambda-mu-Calculus. Inf. Comput. 179 (2) (2002)
Peter Lietz, Thomas Streicher
Impredicativity entails Untypedness. Math. Struct. Comput. Sci. 12 (3) (2002)
Martín Hötzel Escardó, Thomas Streicher
[-1, 1] are Continuous. Math. Log. Q. 48 (S1) (2002)
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) (2000)
Thomas Streicher
Denotational Completeness Revisited. CTCS (1999)
Bernhard Reus, Thomas Streicher
General synthetic domain theory - a logical approach. Math. Struct. Comput. Sci. 9 (2) (1999)
Thomas Streicher
Inductive Construction of Repletion. Appl. Categorical Struct. 7 (1-2) (1999)
Giuseppe Rosolini, Thomas Streicher
Comparing models of higher type computation. Electron. Notes Theor. Comput. Sci. 23 (1) (1999)
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) (1999)
Michael Marz, Alexander Rohr, Thomas Streicher
Full Abstraction and Universality via Realisability. LICS (1999)
Thomas Streicher, Bernhard Reus
Classical Logic, Continuation Semantics and Abstract Machines. J. Funct. Program. 8 (6) (1998)
Bernhard Reus, Thomas Streicher
General Synthetic Domain Theory - A Logical Approach. Category Theory and Computer Science (1997)
Martin Hofmann, Thomas Streicher
Continuation Models are Universal for Lambda-Mu-Calculus. LICS (1997)
Martín Hötzel Escardó, Thomas Streicher
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. LICS (1997)
Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
Reduction-Free Normalisation for a Polymorphic System. LICS (1996)
Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
Reduction-Free Normalisation for a Polymorphic System. ISTCS (1996)
Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
Categorical Reconstruction of a Reduction Free Normalization Proof. Category Theory and Computer Science (1995)
Andy Mück, Thomas Streicher
A Tiny Constrain Functional Logic Language and Its Continuation Semantics. ESOP (1994)
Martin Hofmann, Thomas Streicher
The Groupoid Model Refutes Uniqueness of Identity Proofs LICS (1994)
Thomas Streicher
A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists. Math. Struct. Comput. Sci. 4 (1) (1994)
Bernhard Reus, Thomas Streicher
Verifying Properties of Module Construction in Type Theory. MFCS (1993)
Thomas Streicher
Dependence and Independence Results for (Impredicative) Calculi of Dependent Types. Math. Struct. Comput. Sci. 2 (1) (1992)
Thomas Streicher
Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions. Theor. Comput. Sci. 103 (2) (1992)
Yves Lafont, Thomas Streicher
Games Semantics for Linear Logic LICS (1991)
Bart Jacobs, Eugenio Moggi, Thomas Streicher
Relating Models of Impredicative Type Theories. Category Theory and Computer Science (1991)
Manfred Broy, Thomas Streicher
Specification and design of shared resource arbitration. Int. J. Parallel Program. 20 (1) (1991)
Thomas Streicher, Martin Wirsing
Dependent Types Considered Necessary for Specification Languages. ADT (1990)
Manfred Broy, Thomas Streicher
Modular functional modelling of Petri nets with individual tokems Forschungsberichte, TU Munich (1990)
Thomas Streicher
Independence Results for Calculi of Dependent Types. Category Theory and Computer Science (1989)
Manfred Broy, Thomas Streicher
Views of Distributed Systems. Mathematical Models for the Semantics of Parallelism (1986)
Thomas Streicher
Model Theory of Denotational Semantics. ADT (1984)

Thomas Streicher.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Streicher