Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=309
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The differential lambda-calculus
Thomas Ehrhard
,
Laurent Regnier
Theoretical Computer Science
309
(1-3), 2003, pp. 1-41
Order-incompleteness and finite lambda reduction models
Peter Selinger
Theoretical Computer Science
309
(1-3), 2003, pp. 43-63
A format for semantic equivalence comparison
Vashti Galpin
Theoretical Computer Science
309
(1-3), 2003, pp. 65-109
Better-quasi-orderings and coinduction
Thomas Forster
Theoretical Computer Science
309
(1-3), 2003, pp. 111-123
Paracategories I: Internal paracategories and saturated partial algebras
Claudio Hermida
,
Paulo Mateus
Theoretical Computer Science
309
(1-3), 2003, pp. 125-156
Power simulation and its relation to traces and failures refinement
Paul Gardiner
Theoretical Computer Science
309
(1-3), 2003, pp. 157-176
Coalgebraic modal logic: Soundness, completeness and decidability of local consequence
Dirk Pattinson
Theoretical Computer Science
309
(1-3), 2003, pp. 177-193
Right-linear half-monadic term rewrite systems
Sándor Vágvölgyi
Theoretical Computer Science
309
(1-3), 2003, pp. 195-211
MELL in the calculus of structures
Lutz Straßburger
Theoretical Computer Science
309
(1-3), 2003, pp. 213-285
Normal conditions for inference relations and injective models
Zhaohui Zhu
,
Xian Xiao
,
Yong Zhou
,
Wujia Zhu
Theoretical Computer Science
309
(1-3), 2003, pp. 287-311
Branching time and orthogonal bisimulation equivalence
Jan A. Bergstra
,
Alban Ponse
,
Mark B. van der Zwaag
Theoretical Computer Science
309
(1-3), 2003, pp. 313-355
Structured theories and institutions
Francisco Durán
,
José Meseguer
Theoretical Computer Science
309
(1-3), 2003, pp. 357-380
Two techniques in the area of the star problem in trace monoids
Daniel Kirsten
,
Jerzy Marcinkowski
Theoretical Computer Science
309
(1-3), 2003, pp. 381-412
On iterating linear transformations over recognizable sets of integers
Bernard Boigelot
Theoretical Computer Science
309
(1-3), 2003, pp. 413-468
The regular-language semantics of second-order idealized Algol
Dan R. Ghica
,
Guy McCusker
Theoretical Computer Science
309
(1-3), 2003, pp. 469-502
Concurrency in timed automata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Simone Tini
Theoretical Computer Science
309
(1-3), 2003, pp. 503-527
Realizability of high-level message sequence charts: Closing the gaps
Markus Lohrey
Theoretical Computer Science
309
(1-3), 2003, pp. 529-554