default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Streicher
Person information
- affiliation: TU Darmstadt, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j38]Thomas Streicher
:
The genesis of the groupoid model. Math. Struct. Comput. Sci. 31(9): 1003-1005 (2021)- [j37]Jonas Frey, Thomas Streicher:
Triposes as a generalization of localic geometric morphisms. Math. Struct. Comput. Sci. 31(9): 1024-1033 (2021)
2010 – 2019
- 2018
- [j36]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): 873-888 (2018) - [j35]Eike Neumann, Martin Pape, Thomas Streicher:
Computability in Basic Quantum Mechanics. Log. Methods Comput. Sci. 14(2) (2018) - 2017
- [j34]Thomas Streicher:
A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus. Log. Methods Comput. Sci. 13(4) (2017) - 2016
- [j33]Martín Hötzel Escardó, Thomas Streicher:
The intrinsic topology of Martin-Löf universes. Ann. Pure Appl. Log. 167(9): 794-805 (2016) - [i2]Martin Pape, Thomas Streicher:
Computability in Basic Quantum Mechanics. CoRR abs/1610.09209 (2016) - 2015
- [j32]Samuele Maschio, Thomas Streicher:
Models of intuitionistic set theory in subtoposes of nested realizability toposes. Ann. Pure Appl. Log. 166(6): 729-739 (2015) - 2014
- [j31]Steven Awodey, Carsten Butz, Alex Simpson, Thomas Streicher:
Relating first-order set theories, toposes and categories of classes. Ann. Pure Appl. Log. 165(2): 428-502 (2014) - [j30]Ingo Battenfeld, Klaus Keimel, Thomas Streicher:
Observationally-induced algebras in Domain Theory. Log. Methods Comput. Sci. 10(3) (2014) - [j29]Thomas Streicher:
A model of type theory in simplicial sets: A brief introduction to Voevodsky's homotopy type theory. J. Appl. Log. 12(1): 45-49 (2014) - 2013
- [j28]Thomas Streicher:
Krivine's classical realisability from a categorical perspective. Math. Struct. Comput. Sci. 23(6): 1234-1256 (2013) - 2012
- [j27]Bernhard Reus, Thomas Streicher:
A synthetic theory of sequential domains. Ann. Pure Appl. Log. 163(8): 1062-1074 (2012) - [j26]Alex K. Simpson, Thomas Streicher:
Constructive toposes with countable sums as models of constructive set theory. Ann. Pure Appl. Log. 163(10): 1419-1436 (2012) - [j25]Peter Lietz, Thomas Streicher:
Realizability models refuting Ishihara's boundedness principle. Ann. Pure Appl. Log. 163(12): 1803-1807 (2012) - 2011
- [j24]Klaus Keimel, Artus Ph. Rosenbusch, Thomas Streicher:
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language. Theor. Comput. Sci. 412(25): 2701-2713 (2011) - [c22]Bernhard Reus, Thomas Streicher:
Relative Completeness for Logics of Functional Programs. CSL 2011: 470-480 - 2010
- [j23]Bernhard Reus, Achim Jung, Klaus Keimel, Thomas Streicher:
Preface for the special issue on domains. Math. Struct. Comput. Sci. 20(2): 105-106 (2010)
2000 – 2009
- 2009
- [j22]Klaus Keimel, Artus Ph. 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): 307-317 (2009) - 2008
- [j21]Paulo Oliva, Thomas Streicher:
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic. Fundam. Informaticae 84(2): 207-220 (2008) - 2007
- [j20]Steven Awodey, Carsten Butz, Alex Simpson, Thomas Streicher:
Relating First-order Set Theories and Elementary Toposes. Bull. Symb. Log. 13(3): 340-358 (2007) - [j19]Thomas Streicher, Ulrich Kohlenbach:
Shoenfield is Gödel after Krivine. Math. Log. Q. 53(2): 176-179 (2007) - [j18]Martín Hötzel Escardó, Achim Jung, Thomas Streicher:
Preface. Math. Struct. Comput. Sci. 17(5): 839-839 (2007) - 2006
- [b3]Thomas Streicher:
Domain-theoretic foundations of functional programming. World Scientific 2006, ISBN 978-981-270-142-8, pp. I-X, 1-120 - [j17]Martin Hofmann, Jaap van Oosten, Thomas Streicher:
Well-foundedness in Realizability. Arch. Math. Log. 45(7): 795-805 (2006) - [j16]Martín Hötzel Escardó, Achim Jung, Thomas Streicher:
Preface. Math. Struct. Comput. Sci. 16(2): 139-140 (2006) - [j15]Gary Gruenhage, Thomas Streicher:
Quotients of countably based spaces are not closed under sobrification. Math. Struct. Comput. Sci. 16(2): 223-229 (2006) - [c21]Tobias Löw, Thomas Streicher:
Universality Results for Models in Locally Boolean Domains. CSL 2006: 456-470 - 2005
- [c20]Bernhard Reus, Thomas Streicher:
About Hoare Logics for Higher-Order Store. ICALP 2005: 1337-1348 - [p2]Thomas Streicher:
Universes in Toposes. From sets and types to topology and analysis 2005 - 2004
- [j14]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): 803-814 (2004) - [j13]Bernhard Reus, Thomas Streicher:
Semantics and logic of object calculi. Theor. Comput. Sci. 316(1): 191-213 (2004) - 2002
- [j12]Martin Hofmann, Thomas Streicher:
Completeness of Continuation Models for lambda-mu-Calculus. Inf. Comput. 179(2): 332-355 (2002) - [j11]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) - [j10]Peter Lietz, Thomas Streicher:
Impredicativity entails Untypedness. Math. Struct. Comput. Sci. 12(3): 335-347 (2002) - [c19]Bernhard Reus, Thomas Streicher:
Semantics and Logic of Object Calculi. LICS 2002: 113- - 2000
- [j9]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)
1990 – 1999
- 1999
- [j8]Thomas Streicher:
Inductive Construction of Repletion. Appl. Categorical Struct. 7(1-2): 185-207 (1999) - [j7]Bernhard Reus, Thomas Streicher:
General synthetic domain theory - a logical approach. Math. Struct. Comput. Sci. 9(2): 177-223 (1999) - [j6]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) - [c18]Michael Marz, Alexander Rohr, Thomas Streicher:
Full Abstraction and Universality via Realisability. LICS 1999: 174-182 - [c17]Giuseppe Rosolini, Thomas Streicher:
Comparing models of higher type computation. Realizability Semantics and Applications@FLoC 1999: 159-165 - [c16]Thomas Streicher:
Denotational Completeness Revisited. CTCS 1999: 288-300 - 1998
- [j5]Thomas Streicher, Bernhard Reus:
Classical Logic, Continuation Semantics and Abstract Machines. J. Funct. Program. 8(6): 543-572 (1998) - 1997
- [c15]Bernhard Reus, Thomas Streicher:
General Synthetic Domain Theory - A Logical Approach. Category Theory and Computer Science 1997: 293-313 - [c14]Martín Hötzel Escardó, Thomas Streicher:
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. LICS 1997: 376-386 - [c13]Martin Hofmann, Thomas Streicher:
Continuation Models are Universal for Lambda-Mu-Calculus. LICS 1997: 387-395 - 1996
- [c12]Thorsten Altenkirch, Martin Hofmann, Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System. ISTCS 1996: 146 - [c11]Thorsten Altenkirch, Martin Hofmann, Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System. LICS 1996: 98-106 - 1995
- [c10]Thorsten Altenkirch, Martin Hofmann, Thomas Streicher:
Categorical Reconstruction of a Reduction Free Normalization Proof. Category Theory and Computer Science 1995: 182-199 - 1994
- [j4]Thomas Streicher:
A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists. Math. Struct. Comput. Sci. 4(1): 111-115 (1994) - [c9]Andy Mück, Thomas Streicher:
A Tiny Constrain Functional Logic Language and Its Continuation Semantics. ESOP 1994: 439-453 - [c8]Martin Hofmann, Thomas Streicher:
The Groupoid Model Refutes Uniqueness of Identity Proofs. LICS 1994: 208-212 - 1993
- [c7]Bernhard Reus, Thomas Streicher:
Verifying Properties of Module Construction in Type Theory. MFCS 1993: 660-670 - 1992
- [j3]Thomas Streicher:
Dependence and Independence Results for (Impredicative) Calculi of Dependent Types. Math. Struct. Comput. Sci. 2(1): 29-54 (1992) - [j2]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) - [p1]Manfred Broy, Thomas Streicher:
Modular functional modelling of Petri nets with individual tokens. Advances in Petri Nets: The DEMON Project 1992: 70-88 - 1991
- [b2]Thomas Streicher:
Semantics of type theory - correctness, completeness and independence results. Progress in theoretical computer science, Birkhäuser 1991, ISBN 978-0-8176-3594-7, pp. I-XII, 1-298 - [j1]Manfred Broy, Thomas Streicher:
Specification and design of shared resource arbitration. Int. J. Parallel Program. 20(1): 1-22 (1991) - [c6]Bart Jacobs, Eugenio Moggi, Thomas Streicher:
Relating Models of Impredicative Type Theories. Category Theory and Computer Science 1991: 197-218 - [c5]Yves Lafont, Thomas Streicher:
Games Semantics for Linear Logic. LICS 1991: 43-50 - 1990
- [c4]Thomas Streicher, Martin Wirsing:
Dependent Types Considered Necessary for Specification Languages. ADT 1990: 323-340 - [i1]Manfred Broy, Thomas Streicher:
Modular functional modelling of Petri nets with individual tokems. Forschungsberichte, TU Munich TUM I 9035: 1-22 (1990)
1980 – 1989
- 1989
- [b1]Thomas Streicher:
Correctness and completeness of a categorical semantics of the calculus of constructions. University of Passau, Germany, 1989 - [c3]Thomas Streicher:
Independence Results for Calculi of Dependent Types. Category Theory and Computer Science 1989: 141-154 - 1986
- [c2]Manfred Broy, Thomas Streicher:
Views of Distributed Systems. Mathematical Models for the Semantics of Parallelism 1986: 114-143 - 1984
- [c1]Thomas Streicher:
Model Theory of Denotational Semantics. ADT 1984: 240-253
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
