Thomas Streicher
#52,090
Most Influential Person Now
German mathematician
Thomas Streicher's AcademicInfluence.com Rankings
Thomas Streichermathematics Degrees
Mathematics
#4352
World Rank
#6201
Historical Rank
Group Theory
#306
World Rank
#357
Historical Rank
Algebra
#407
World Rank
#558
Historical Rank
Measure Theory
#3772
World Rank
#4449
Historical Rank
Download Badge
Mathematics
Why Is Thomas Streicher Influential?
(Suggest an Edit or Addition)According to Wikipedia, Thomas Streicher is an Austrian mathematician who is a Professor of Mathematics at Technische Universität Darmstadt. He received his PhD in 1988 from the University of Passau with advisor Manfred Broy.
Thomas Streicher's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- The groupoid interpretation of type theory (1998) (312)
- Classical logic, continuation semantics and abstract machines (1998) (140)
- Semantics of Type Theory (1991) (121)
- Categorical Reconstruction of a Reduction Free Normalization Proof (1995) (98)
- The groupoid model refutes uniqueness of identity proofs (1994) (96)
- Games semantics for linear logic (1991) (92)
- Semantics of type theory - correctness, completeness and independence results (1991) (82)
- Domain-theoretic foundations of functional programming (2006) (55)
- Continuation models are universal for lambda-mu-calculus (1997) (50)
- General synthetic domain theory – a logical approach (1997) (49)
- Continuation Models Are Universal for -calculus (1997) (47)
- Universes in Toposes (2005) (40)
- Fibred Categories a la Jean Benabou (2018) (38)
- Shoenfield is Gödel after Krivine (2007) (36)
- A model of type theory in simplicial sets: A brief introduction to Voevodsky's homotopy type theory (2014) (36)
- Correctness and completeness of a categorical semantics of the calculus of constructions (1989) (32)
- Reduction-free normalisation for a polymorphic system (1996) (31)
- On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic (2008) (28)
- Impredicativity entails untypedness (2002) (28)
- On the non-sequential nature of the interval-domain model of real-number computation (2004) (26)
- Semantics and logic of object calculi (2002) (26)
- Induction and Recursion on the Partial Real Line with Applications to Real PCF (1999) (24)
- Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions (1992) (23)
- Completeness of Continuation Models for lambda-mu-Calculus (2002) (21)
- Relating first-order set theories, toposes and categories of classes (2014) (20)
- Krivine's classical realisability from a categorical perspective (2013) (17)
- Quotients of countably based spaces are not closed under sobrification (2006) (17)
- About Hoare Logics for Higher-Order Store (2005) (16)
- Relating Topos Theory and Set Theory Via Categories of Classes (2003) (16)
- A Tiny Constrain Functional Logic Language and Its Continuation Semantics (1994) (14)
- Continuation models are universal for /spl lambda//sub /spl mu//-calculus (1997) (14)
- A universality theorem for PCF with recursive types, parallel-or and ∃ (1994) (13)
- Real PCF extended with is universal (Extended Abstract) (1996) (13)
- Verifying Properties of Module Construction in Type Theory (1993) (13)
- Modular functional modelling of Petri nets with individual tokens (1992) (13)
- Full abstraction and universality via realisability (1999) (13)
- Semantics and logics of objects (1999) (12)
- Relating First-Order Set Theories and Elementary Toposes (2007) (12)
- Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice (2018) (12)
- Continuation models are universal for Xp-calculus (1997) (12)
- Comparing models of higher type computation (1999) (11)
- A Category of Topological Predomains (2008) (11)
- Dependence and independence results for (impredicative) calculi of dependent types (1992) (9)
- Dependent Types Considered Necessary for Specification Languages (1990) (9)
- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language (2009) (7)
- A Semantic Version of the Diller-Nahm Variant of Gödel’s Dialectica Interpretation (2000) (6)
- Inductive Construction of Repletion (1999) (6)
- Universality Results for Models in Locally Boolean Domains (2006) (6)
- Induction and recursion on the partial real line via biquotients of bifree algebras (1997) (6)
- Realizability models refuting Ishihara's boundedness principle (2012) (6)
- Denotational Completeness Revisited (1999) (6)
- Views of Distributed Systems (1986) (5)
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language (2011) (5)
- Relating Models of Impredicative Type Theories (1991) (5)
- How Intensional Is Homotopy Type Theory (2015) (5)
- The intrinsic topology of Martin-Löf universes (2016) (5)
- Well-foundedness in Realizability (2006) (4)
- Independence Results for Calculi of Dependent Types (1989) (4)
- Contextual Categories and Categorical Semantics of Dependent Types (1991) (4)
- Specification and design of shared resource arbitration (1991) (3)
- Simplicial sets inside cubical sets (2019) (3)
- Forcing for IZF in Sheaf Toposes (2009) (3)
- A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus (2014) (3)
- Distribution Algebras and Duality (2000) (3)
- The Michael completion of a topos spread (2002) (3)
- Models of intuitionistic set theory in subtoposes of nested realizability toposes (2014) (2)
- Relative Completeness for Logics of Functional Programs (2011) (2)
- An Essential Local Geometric Morphism which is not Locally Connected though its Inverse Image Part defines an Exponential Ideal (2021) (2)
- A model of a dependent linear calculus (2001) (2)
- In Domain Realizability, not all Functionals on C[-1, 1] are Continuous (2002) (2)
- The universe is indiscrete (2013) (2)
- A synthetic theory of sequential domains (2012) (1)
- Model Theory of Denotational Semantics (1984) (1)
- Constructive toposes with countable sums as models of constructive set theory (2012) (1)
- Computability in Basic Quantum Mechanics (2016) (1)
- Triposes as a generalization of localic geometric morphisms (2020) (1)
- Preface dedicated to Klaus Keimel on the occasion of his 65th birthday (2006) (1)
- Dagstuhl Seminar 01141, 2–6 April, 2001 Semantic Foundations of Proof-search (2008) (0)
- Topological predomains and qcb spaces are not closed under sobrification (2005) (0)
- The genesis of the groupoid model (2020) (0)
- Preface (2007) (0)
- The intrinsic topology of Martin-Löf universes Mart́ın Hötzel Escardó (2016) (0)
- Solutions of Recursive Domain Equations (2006) (0)
- Some Structural Properties of the Dσ (2006) (0)
- University of Birmingham The intrinsic topology of Martin-Löf universes (2016) (0)
- Models for the Calculus of Constructions and Its Extensions (1991) (0)
- PARTIAL TOPOSES JEAN BÉNABOU AND THOMAS STREICHER (2003) (0)
- PCF and its Operational Semantics (2006) (0)
- 11 Recursively Inseparable Sets and the Kleene Tree (2008) (0)
- PROGRAMME FOR 104TH PERIPATETIC SEMINAR ON SHEAVES AND LOGIC (2018) (0)
- The Scott Model of PCF (2006) (0)
- The Model of PCF in S is Fully Abstract (2006) (0)
- The Full Abstraction Problem (2006) (0)
- WORKSHOP ON FOUNDATIONS OF MATHEMATICS: UNIVALENT FOUNDATIONS AND SET THEORY (FOMUS 2016) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Bielefeld, Germany July 18–23, 2016 (2017) (0)
- Sequential Domains as a Model of PCF (2006) (0)
- The Term Model of the Calculus of Constructions and Its Metamathematical Applications (1991) (0)
- Correctness of the Interpretation of the Calculus of Constructions in Doctrines of Constructions (1991) (0)
- On the paper definable completeness (2009) (0)
- Characterisation of Fully Abstract Models (2006) (0)
- A comonad for Grothendieck fibrations (2023) (0)
- Milner's Context Lemma (2006) (0)
- Semantic Foundations of Proof-search (Dagstuhl Seminar 01141) (2021) (0)
- Relating First-Order Set Theories and Elementary (2015) (0)
- Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice (2018) (0)
- Preface (2006) (0)
- Preface for the special issue on domains (2010) (0)
- 2005 Microwave Electronics: Measurements, Identification, Applications (2005) (0)
- Sunday Recap: Exhibit Hall Opens, Committee Meetings in Full Swing (2009) (0)
- Computability in Domains (2006) (0)
- Machine tool with a clamping device and method (2016) (0)
- 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 (2000) (0)
- Countable Ideals Models for CZF (2010) (0)
- Choice Sequences vs . Formal Topology (2015) (0)
- Related Work, Extensions and Directions of Further Investigations (1991) (0)
- Practical Foundations of Mathematics (2000) (0)
- Towards a Logic of Sequential Computation (2006) (0)
This paper list is powered by the following services:
Other Resources About Thomas Streicher
What Schools Are Affiliated With Thomas Streicher?
Thomas Streicher is affiliated with the following schools:
