Thomas Streicher

67 papers A* 8A 1B 3Journal 40Unranked 10

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