TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 20.

Kohlenbach, Ulrich and Streicher, Thomas (2007):
Shoenfield is Goedel after Krivine.
53, In: Mathematical Logic Quarterly : MLQ., pp. 176-179, [Article]

Streicher, Thomas (2006):
Domain-Theoretic Foundations of Functional Programming.
Singapore, World Scientific, ISBN 978-981-270-142-8,
[Book]

Gruenhage, Gary and Streicher, Thomas (2006):
Quotients of countably based spaces are not closed under sobrification.
16, In: Mathematical Structures in Computer Science, pp. 223--229, [Article]

Loew, Tobias and Streicher, Thomas (2006):
Universality results for models in locally boolean domains.
In: Computer science logic : 20th international workshop, CSL 2006, 15th annual conference of the EACSL, Szeged, Hungary, September 25 - 29, 2006 ; proceedings / Zoltán Ésik (ed.). - Berlin [u.a.] : Springer, 2006, S. 456-470 (Lecture notes in computer scie, Berlin [u.a.], Springer, pp. 456--470, [Conference or Workshop Item]

Hofmann, Martin and van Oosten, Jaap and Streicher, Thomas (2006):
Well-foundedness in realizability.
45, In: Archive for mathematical logic, pp. 795--805, [Article]

Hofmann, M. and Streicher, Thomas (2002):
Completeness of continuation models for gamma(mu)-calculus.
179, In: Information and computation, pp. 332-355, [Article]

Hofmann, Martin and Streicher, Thomas (2002):
Completeness of continuation models for lambda my-calculus.
179, In: Information and computation, pp. 332-355, [Article]

Lietz, Peter and Streicher, Thomas (2002):
Impredicativity entails untypedness.
12, In: Mathematical structures in computer science, pp. 335-347, [Article]

Bunge, Marta and Funk, Jonathan and Jibladze, Mamuka and Streicher, Thomas (2002):
The Michael completion of a topos spread.
175, In: Journal of pure and applied algebra, pp. 63-91, [Article]

Reus, Bernhard and Streicher, Thomas (2002):
Semantics and logics of objects.
In: Proceedings of LICS' 02 Symposium on logic in computer science <17, 2002, Copenhagen>. - Los Alamitos, Calif. [u.a.]: IEEE Comp. Soc., 2002, Los Alamitos, Calif. [u.a.], IEEE Comp. Soc., [Conference or Workshop Item]

Marz, Michael and Rohr, A. and Streicher, Thomas (1999):
Full abstraction and universality via realisability.
In: Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Science Press, 1999. S. 174-182, [Conference or Workshop Item]

Escardó, M. H. and Streicher, Thomas (1999):
Induction and recursion on the partial real line with applications to Real PCF.
210, In: Theoretical computer science, pp. 121-157, [Article]

Streicher, Thomas (1999):
Inductive construction of repletion.
7, In: Applied categorical structures, pp. 185-207, [Article]

Reus, B. and Streicher, Thomas (1999):
Semantics and logics of objects.
In: Logic in computer science <14, 1999, Trento, IT> : proceedings .- 2002, [Conference or Workshop Item]

Streicher, Thomas and Reus, (1998):
Classical logic, continuation semantics and abstract machines.
In: Journal of functional programming. 8 (1998), S. 543-572, [Article]

Hofmann, Martin and Streicher, Thomas (1998):
The groupoid interpretation of type theory.
In: Meeting Twenty-Five Years of Constructive Type Theory <1995, Venice>: Proceedings. Hrsg.: G. Sambin (u.a.), Oxford: Univ. Press, 1998,
Oxford, Univ. Press, [Conference or Workshop Item]

Reus, B. and Streicher, Thomas (1997):
General synthetic domain theory - a logical approach.
In: Domains III: Workshop; Proceedings. Hrsg.: K.-H. Niggl (u.a.) S. 93-112, 9712, München: Ludwig-Maximilians-Univ., Inst. für Informatik, 1997,
München, Ludwig-Maximilians-Univ, [Conference or Workshop Item]

Hofmann, Martin and Streicher, Thomas (1997):
Continuation models are universal for lambda-mu calculus.
In: Annual IEEE Symposium on Logic in Computer Science (LICS97) <12, 1997, Warsaw, Poland>: Proceedings. S. 387-397, [Conference or Workshop Item]

Escardó, M. H. and Streicher, Thomas (1997):
Induction and recursion on the partial real line via biquotients of bifree algebras.
In: Annual IEEE Symposium on Logic in Computer Science (LICS'97) <12, 1997, Warsaw, Poland>: Proceedings. S. 376-386, [Conference or Workshop Item]

Altenkirch, Thorsten and Hofmann, Martin and Streicher, Thomas (1995):
Categorical reconstruction of a reduction free normalization proof.
In: Category Theory and Computer Science <1995, Cambridge>: Proceedings. Hrsg.: D. Pitt et al. - Berlin, Heidelberg (u.a.): Springer, 1995, 953, Berlin, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

This list was generated on Tue Jan 21 01:57:45 2020 CET.