Thomas Streicher

According to our database, Thomas Streicher authored at least 63 papers between 1984 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2021

The genesis of the groupoid model.

Thomas Streicher

Math. Struct. Comput. Sci., 2021

Triposes as a generalization of localic geometric morphisms.

Jonas Frey, Thomas Streicher

Math. Struct. Comput. Sci., 2021

2018

Computability in Basic Quantum Mechanics.

Eike Neumann, Martin Pape, Thomas Streicher

Log. Methods Comput. Sci., 2018

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

2017

A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus.

Thomas Streicher

Log. Methods Comput. Sci., 2017

2016

Computability in Basic Quantum Mechanics.

Martin Pape, Thomas Streicher

CoRR, 2016

The intrinsic topology of Martin-Löf universes.

Martín Hötzel Escardó, Thomas Streicher

Ann. Pure Appl. Log., 2016

2015

Models of intuitionistic set theory in subtoposes of nested realizability toposes.

Samuele Maschio, Thomas Streicher

Ann. Pure Appl. Log., 2015

2014

A model of type theory in simplicial sets: A brief introduction to Voevodsky's homotopy type theory.

Thomas Streicher

J. Appl. Log., 2014

Observationally-induced algebras in Domain Theory.

Ingo Battenfeld, Klaus Keimel, Thomas Streicher

Log. Methods Comput. Sci., 2014

Relating first-order set theories, toposes and categories of classes.

Steven Awodey, Carsten Butz, Alex Simpson, Thomas Streicher

Ann. Pure Appl. Log., 2014

2013

Krivine's classical realisability from a categorical perspective.

Thomas Streicher

Math. Struct. Comput. Sci., 2013

2012

Constructive toposes with countable sums as models of constructive set theory.

Alex K. Simpson, Thomas Streicher

Ann. Pure Appl. Log., 2012

A synthetic theory of sequential domains.

Bernhard Reus, Thomas Streicher

Ann. Pure Appl. Log., 2012

Realizability models refuting Ishihara's boundedness principle.

Peter Lietz, Thomas Streicher

Ann. Pure Appl. Log., 2012

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

Relative Completeness for Logics of Functional Programs.

Bernhard Reus, Thomas Streicher

Proceedings of the Computer Science Logic, 2011

2010

Preface for the special issue on domains.

Bernhard Reus, Achim Jung, Klaus Keimel, Thomas Streicher

Math. Struct. Comput. Sci., 2010

2009

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

2008

On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic.

Paulo Oliva, Thomas Streicher

Fundam. Informaticae, 2008

2007

Shoenfield is Gödel after Krivine.

Thomas Streicher, Ulrich Kohlenbach

Math. Log. Q., 2007

Relating First-order Set Theories and Elementary Toposes.

Steven Awodey, Carsten Butz, Alex Simpson, Thomas Streicher

Bull. Symb. Log., 2007

2006

Quotients of countably based spaces are not closed under sobrification.

Gary Gruenhage, Thomas Streicher

Math. Struct. Comput. Sci., 2006

Preface.

Martín Hötzel Escardó, Achim Jung, Thomas Streicher

Math. Struct. Comput. Sci., 2006

Well-foundedness in Realizability.

Martin Hofmann, Jaap van Oosten, Thomas Streicher

Arch. Math. Log., 2006

Universality Results for Models in Locally Boolean Domains.

Tobias Löw, Thomas Streicher

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Domain-theoretic foundations of functional programming.

Thomas Streicher

World Scientific, ISBN: 978-981-270-142-8, 2006

2005

About Hoare Logics for Higher-Order Store.

Bernhard Reus, Thomas Streicher

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Universes in Toposes.

Thomas Streicher

Proceedings of the From sets and types to topology and analysis, 2005

2004

Semantics and logic of object calculi.

Bernhard Reus, Thomas Streicher

Theor. Comput. Sci., 2004

On the non-sequential nature of the interval-domain model of real-number computation.

Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher

Math. Struct. Comput. Sci., 2004

2002

Impredicativity entails Untypedness.

Peter Lietz, Thomas Streicher

Math. Struct. Comput. Sci., 2002

In Domain Realizability, not all Functionals on <i>C</i>[-1, 1] are Continuous.

Martín Hötzel Escardó, Thomas Streicher

Math. Log. Q., 2002

Completeness of Continuation Models for lambda-mu-Calculus.

Martin Hofmann, Thomas Streicher

Inf. Comput., 2002

2000

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

1999

Denotational Completeness Revisited.

Thomas Streicher

Proceedings of the Conference on Category Theory and Computer Science, 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

General synthetic domain theory - a logical approach.

Bernhard Reus, Thomas Streicher

Math. Struct. Comput. Sci., 1999

Comparing models of higher type computation.

Giuseppe Rosolini, Thomas Streicher

Proceedings of the Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30, 1999

Inductive Construction of Repletion.

Thomas Streicher

Appl. Categorical Struct., 1999

Full Abstraction and Universality via Realisability.

Michael Marz, Alexander Rohr, Thomas Streicher

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Classical Logic, Continuation Semantics and Abstract Machines.

Thomas Streicher, Bernhard Reus

J. Funct. Program., 1998

1997

Continuation Models are Universal for Lambda-Mu-Calculus.

Martin Hofmann, Thomas Streicher

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras.

Martín Hötzel Escardó, Thomas Streicher

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996

Reduction-Free Normalisation for a Polymorphic System.

Thorsten Altenkirch, Martin Hofmann, Thomas Streicher

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Categorical Reconstruction of a Reduction Free Normalization Proof.

Thorsten Altenkirch, Martin Hofmann, Thomas Streicher

Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994

A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists.

Thomas Streicher

Math. Struct. Comput. Sci., 1994

The Groupoid Model Refutes Uniqueness of Identity Proofs

Martin Hofmann, Thomas Streicher

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

A Tiny Constrain Functional Logic Language and Its Continuation Semantics.

Andy Mück, Thomas Streicher

Proceedings of the Programming Languages and Systems, 1994

1993

Verifying Properties of Module Construction in Type Theory.

Bernhard Reus, Thomas Streicher

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions.

Thomas Streicher

Theor. Comput. Sci., 1992

Dependence and Independence Results for (Impredicative) Calculi of Dependent Types.

Thomas Streicher

Math. Struct. Comput. Sci., 1992

Modular functional modelling of Petri nets with individual tokens.

Manfred Broy, Thomas Streicher

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991

Specification and design of shared resource arbitration.

Manfred Broy, Thomas Streicher

Int. J. Parallel Program., 1991

Games Semantics for Linear Logic

Yves Lafont, Thomas Streicher

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Relating Models of Impredicative Type Theories.

Bart Jacobs, Eugenio Moggi, Thomas Streicher

Proceedings of the Category Theory and Computer Science, 1991

Semantics of type theory - correctness, completeness and independence results.

Thomas Streicher

Progress in theoretical computer science, Birkhäuser, ISBN: 978-0-8176-3594-7, 1991

1990

Modular functional modelling of Petri nets with individual tokems

Manfred Broy, Thomas Streicher

Forschungsberichte, TU Munich, 1990

Dependent Types Considered Necessary for Specification Languages.

Thomas Streicher, Martin Wirsing

Proceedings of the Recent Trends in Data Type Specification, 1990

1989

Correctness and completeness of a categorical semantics of the calculus of constructions.

Thomas Streicher

PhD thesis, 1989

Independence Results for Calculi of Dependent Types.

Thomas Streicher

Proceedings of the Category Theory and Computer Science, 1989

1986

Views of Distributed Systems.

Manfred Broy, Thomas Streicher

Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

1984

Model Theory of Denotational Semantics.

Thomas Streicher

Proceedings of the Recent Trends in Data Type Specification, 1984