T. Streicher

Most-cited papers

The groupoid interpretation of type theory
M. Hofmann, T. Streicher
1998338 citations
Semantic Scholar
Classical logic, continuation semantics and abstract machines
T. Streicher, Bernhard Reus
1998Journal of functional programming143 citations Open access
Semantic Scholar
Categorical Reconstruction of a Reduction Free Normalization Proof
Thorsten Altenkirch, M. Hofmann, T. Streicher
1995Category Theory and Computer Science116 citations
Semantic Scholar
The groupoid model refutes uniqueness of identity proofs
M. Hofmann, T. Streicher
1994Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science108 citations
Semantic Scholar
Domain-theoretic foundations of functional programming
T. Streicher
200670 citations
Semantic Scholar
General synthetic domain theory – a logical approach
Bernhard Reus, T. Streicher
1997Mathematical Structures in Computer Science60 citations
Semantic Scholar
Fibered Categories a la Jean Benabou
T. Streicher
201856 citations
Semantic Scholar
Continuation models are universal for lambda-mu-calculus
M. Hofmann, T. Streicher
1997Logic in Computer Science55 citations
Semantic Scholar
Continuation Models Are Universal for -calculus
T. Streicher
199748 citations
Semantic Scholar
Universes in Toposes
T. Streicher
2005From sets and types to topology and analysis47 citations
Semantic Scholar
A model of type theory in simplicial sets: A brief introduction to Voevodsky's homotopy type theory
T. Streicher
2014Journal of Applied Logic35 citations Open access
Semantic Scholar
Shoenfield is Gödel after Krivine
T. Streicher, U. Kohlenbach
2007Mathematical Logic Quarterly34 citations
Semantic Scholar
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
Paulo Oliva, T. Streicher
2008Fundamenta Informaticae32 citations
Semantic Scholar
Reduction-free normalisation for a polymorphic system
Thorsten Altenkirch, M. Hofmann, T. Streicher
1996Proceedings 11th Annual IEEE Symposium on Logic in Computer Science32 citations
Semantic Scholar
Program verification in synthetic domain theory
T. Streicher
199524 citations
Semantic Scholar
Relating first-order set theories, toposes and categories of classes
S. Awodey, Carsten Butz, Alex K. Simpson, T. Streicher
2014Annals of Pure and Applied Logic23 citations Open access
Semantic Scholar
Semantics and logic of object calculi
Bernhard Reus, T. Streicher
2002Proceedings 17th Annual IEEE Symposium on Logic in Computer Science23 citations Open access
Semantic Scholar
Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice
H. Ishihara, M. E. Maietti, Samuele Maschio, T. Streicher
2018Archive for Mathematical Logic22 citations Open access
Semantic Scholar
Krivine's classical realisability from a categorical perspective
T. Streicher
2013Mathematical Structures in Computer Science22 citations
Semantic Scholar
On the non-sequential nature of the interval-domain model of real-number computation
M. Escardó, M. Hofmann, T. Streicher
2004Mathematical Structures in Computer Science22 citations Open access
Semantic Scholar
Completeness of Continuation Models for lambda-mu-Calculus
M. Hofmann, T. Streicher
2002Information and Computation22 citations Open access
Semantic Scholar
Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions
T. Streicher
1992Theoretical Computer Science22 citations Open access
Semantic Scholar
Induction and Recursion on the Partial Real Line with Applications to Real PCF
M. Escardó, T. Streicher
1999Theoretical Computer Science21 citations Open access
Semantic Scholar
Relating Topos Theory and Set Theory Via Categories of Classes
S. Awodey, A. Simpson, T. Streicher
200319 citations
Semantic Scholar
About Hoare Logics for Higher-Order Store
Bernhard Reus, T. Streicher
2005International Colloquium on Automata, Languages and Programming17 citations Open access
Semantic Scholar
Relating First-Order Set Theories and Elementary Toposes
S. Awodey, C. Butz, A. Simpson, T. Streicher
2007Bulletin of Symbolic Logic15 citations Open access
Semantic Scholar
Full abstraction and universality via realisability
M. Marz, Alexander Rohr, T. Streicher
1999Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)15 citations
Semantic Scholar
Continuation models are universal for /spl lambda//sub /spl mu//-calculus
M. Hofmann, T. Streicher
1997Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science15 citations
Semantic Scholar
A Tiny Constrain Functional Logic Language and Its Continuation Semantics
A. Mück, T. Streicher, H. Lock
1994European Symposium on Programming14 citations
Semantic Scholar
A Category of Topological Predomains
T. Streicher
200813 citations
Semantic Scholar
Continuation models are universal for Xp-calculus
M. Hofmann, T. Streicher
199713 citations
Semantic Scholar
A universality theorem for PCF with recursive types, parallel-or and ∃
T. Streicher
1994Mathematical Structures in Computer Science13 citations
Semantic Scholar
Verifying Properties of Module Construction in Type Theory
Bernhard Reus, T. Streicher
1993International Symposium on Mathematical Foundations of Computer Science13 citations
Semantic Scholar
Modular functional modelling of Petri nets with individual tokens
M. Broy, T. Streicher
1992Advances in Petri Nets: The DEMON Project13 citations
Semantic Scholar
Impredicativity entails untypedness
Peter Lietz, T. Streicher
2002Mathematical Structures in Computer Science12 citations
Semantic Scholar
Semantics and logics of objects
Bernhard Reus, T. Streicher
199912 citations
Semantic Scholar
Comparing models of higher type computation
G. Rosolini, T. Streicher
1999Realizability Semantics and Applications@FLoC12 citations Open access
Semantic Scholar
Real PCF extended with is universal (Extended Abstract)
T. Streicher
199612 citations
Semantic Scholar
The intrinsic topology of Martin-Löf universes
M. Escardó, T. Streicher
2016Annals of Pure and Applied Logic9 citations Open access
Semantic Scholar
Dependence and independence results for (impredicative) calculi of dependent types
T. Streicher
1992Mathematical Structures in Computer Science9 citations
Semantic Scholar
Realizability models refuting Ishihara's boundedness principle
Peter Lietz, T. Streicher
2012Annals of Pure and Applied Logic8 citations Open access
Semantic Scholar
Observationally-induced Algebras in Domain Theory
Ingo Battenfeld, K. Keimel, T. Streicher
2014International Symposium on Domain Theory and Its Applications7 citations Open access
Semantic Scholar
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
K. Keimel, Artus Ph. Rosenbusch, T. Streicher
2009Annals of Pure and Applied Logic7 citations Open access
Semantic Scholar
Universality Results for Models in Locally Boolean Domains
Tobias Löw, T. Streicher
2006Annual Conference for Computer Science Logic7 citations
Semantic Scholar
Inductive Construction of Repletion
T. Streicher
1999Applied Categorical Structures7 citations
Semantic Scholar
Denotational Completeness Revisited
T. Streicher
1999Category Theory and Computer Science7 citations Open access
Semantic Scholar
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
K. Keimel, Artus Ph. Rosenbusch, T. Streicher
2011Theoretical Computer Science6 citations Open access
Semantic Scholar
Forcing for IZF in Sheaf Toposes
T. Streicher
20096 citations Open access
Semantic Scholar
A comonad for Grothendieck fibrations
Jacopo Emmenegger, Luca Mesiti, G. Rosolini, T. Streicher
2023Theory and Applications of Categories5 citations Open access
Semantic Scholar
Simplicial sets inside cubical sets
T. Streicher, J. Weinberger
2019Theory and Applications of Categories5 citations
Semantic Scholar