Search the dblp DataBase
Thomas Streicher :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Manfred Broy , Thomas Streicher Views of Distributed Systems. [Citation Graph (0, 0)][DBLP ] Mathematical Models for the Semantics of Parallelism, 1986, pp:114-143 [Conf ] Thomas Streicher Model Theory of Denotational Semantics. [Citation Graph (0, 0)][DBLP ] ADT, 1984, pp:240-253 [Conf ] Thomas Streicher , Martin Wirsing Dependent Types Considered Necessary for Specification Languages. [Citation Graph (0, 0)][DBLP ] ADT, 1990, pp:323-340 [Conf ] Manfred Broy , Thomas Streicher Modular functional modelling of Petri nets with individual tokens. [Citation Graph (0, 0)][DBLP ] Advances in Petri Nets: The DEMON Project, 1992, pp:70-88 [Conf ] Tobias Löw , Thomas Streicher Universality Results for Models in Locally Boolean Domains. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:456-470 [Conf ] Thorsten Altenkirch , Martin Hofmann , Thomas Streicher Categorical Reconstruction of a Reduction Free Normalization Proof. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1995, pp:182-199 [Conf ] Bernhard Reus , Thomas Streicher General Synthetic Domain Theory - A Logical Approach. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1997, pp:293-313 [Conf ] Thomas Streicher Independence Results for Calculi of Dependent Types. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1989, pp:141-154 [Conf ] Bart Jacobs , Eugenio Moggi , Thomas Streicher Relating Models of Impredicative Type Theories. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1991, pp:197-218 [Conf ] Andy Mück , Thomas Streicher A Tiny Constrain Functional Logic Language and Its Continuation Semantics. [Citation Graph (0, 0)][DBLP ] ESOP, 1994, pp:439-453 [Conf ] Bernhard Reus , Thomas Streicher About Hoare Logics for Higher-Order Store. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:1337-1348 [Conf ] Thorsten Altenkirch , Martin Hofmann , Thomas Streicher Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP ] ISTCS, 1996, pp:146- [Conf ] Thorsten Altenkirch , Martin Hofmann , Thomas Streicher Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP ] LICS, 1996, pp:98-106 [Conf ] Yves Lafont , Thomas Streicher Games Semantics for Linear Logic [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:43-50 [Conf ] Martín Hötzel Escardó , Thomas Streicher Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. [Citation Graph (0, 0)][DBLP ] LICS, 1997, pp:376-386 [Conf ] Martin Hofmann , Thomas Streicher The Groupoid Model Refutes Uniqueness of Identity Proofs [Citation Graph (0, 0)][DBLP ] LICS, 1994, pp:208-212 [Conf ] Martin Hofmann , Thomas Streicher Continuation Models are Universal for Lambda-Mu-Calculus. [Citation Graph (0, 0)][DBLP ] LICS, 1997, pp:387-395 [Conf ] Michael Marz , Alexander Rohr , Thomas Streicher Full Abstraction and Universality via Realisability. [Citation Graph (0, 0)][DBLP ] LICS, 1999, pp:174-182 [Conf ] Bernhard Reus , Thomas Streicher Semantics and Logic of Object Calculi. [Citation Graph (0, 0)][DBLP ] LICS, 2002, pp:113-0 [Conf ] Bernhard Reus , Thomas Streicher Verifying Properties of Module Construction in Type Theory. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:660-670 [Conf ] Martin Hofmann , Jaap van Oosten , Thomas Streicher Well-foundedness in Realizability. [Citation Graph (0, 0)][DBLP ] Arch. Math. Log., 2006, v:45, n:7, pp:795-805 [Journal ] Giuseppe Rosolini , Thomas Streicher Comparing models of higher type computation. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal ] Martin Hofmann , Thomas Streicher Completeness of Continuation Models for lambda-mu-Calculus. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:179, n:2, pp:332-355 [Journal ] Thomas Streicher , Bernhard Reus Classical Logic, Continuation Semantics and Abstract Machines. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 1998, v:8, n:6, pp:543-572 [Journal ] Martín Hötzel Escardó , Thomas Streicher In Domain Realizability, not all Functionals on C [-1, 1] are Continuous. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 2002, v:48, n:S1, pp:41-44 [Journal ] Martín Hötzel Escardó , Martin Hofmann , Thomas Streicher On the non-sequential nature of the interval-domain model of real-number computation. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2004, v:14, n:6, pp:803-814 [Journal ] Peter Lietz , Thomas Streicher Impredicativity entails Untypedness. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2002, v:12, n:3, pp:335-347 [Journal ] Bernhard Reus , Thomas Streicher General synthetic domain theory - a logical approach. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 1999, v:9, n:2, pp:177-223 [Journal ] Thomas Streicher Dependence and Independence Results for (Impredicative) Calculi of Dependent Types. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 1992, v:2, n:1, pp:29-54 [Journal ] Thomas Streicher A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 1994, v:4, n:1, pp:111-115 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 2000, v:38, n:1-3, pp:155-157 [Journal ] Martín Hötzel Escardó , Thomas Streicher Induction and Recursion on the Partial Real Line with Applications to Real PCF. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:210, n:1, pp:121-157 [Journal ] Bernhard Reus , Thomas Streicher Semantics and logic of object calculi. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:316, n:1, pp:191-213 [Journal ] Thomas Streicher Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:103, n:2, pp:395-408 [Journal ] Thomas Streicher Denotational Completeness Revisited. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:29, n:, pp:- [Journal ] Inductive Construction of Repletion. [Citation Graph (, )][DBLP ] A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language. [Citation Graph (, )][DBLP ] Relating First-order Set Theories and Elementary Toposes. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.306secs