TU Darmstadt / ULB / TUbiblio

Browsen nach Person

Ebene hoch
Gruppiere nach: Keine Gruppierung | Typ des Eintrags | Datum | Sprache
Anzahl der Einträge: 20.

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

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

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

Loew, Tobias ; Streicher, Thomas :
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 . Springer , Berlin [u.a.]
[Konferenz- oder Workshop-Beitrag], (2006)

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

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

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

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

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

Reus, Bernhard ; Streicher, Thomas :
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 . IEEE Comp. Soc. , Los Alamitos, Calif. [u.a.]
[Konferenz- oder Workshop-Beitrag], (2002)

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

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

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

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

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

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

Reus, B. ; Streicher, Thomas :
General synthetic domain theory - a logical approach.
In: Domains III: Workshop; Proceedings. Hrsg.: K.-H. Niggl (u.a.) S. 93-112 , 9712 . Ludwig-Maximilians-Univ , München
[Konferenz- oder Workshop-Beitrag], (1997)

Hofmann, Martin ; Streicher, Thomas :
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 .
[Konferenz- oder Workshop-Beitrag], (1997)

Escardó, M. H. ; Streicher, Thomas :
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 .
[Konferenz- oder Workshop-Beitrag], (1997)

Altenkirch, Thorsten ; Hofmann, Martin ; Streicher, Thomas :
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 . Springer , Berlin, Heidelberg (u.a.)
[Konferenz- oder Workshop-Beitrag], (1995)

Diese Liste wurde am Tue Sep 19 08:14:33 2017 CEST generiert.