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=464
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modularity in term rewriting revisited
Bernhard Gramlich
Theoretical Computer Science
464
, 2012, pp. 3-19
From diagrammatic confluence to modularity
Jean-Pierre Jouannaud
,
Jiaxiang Liu
Theoretical Computer Science
464
, 2012, pp. 20-34
Jumping and escaping: Modular termination and the abstract path ordering
Nachum Dershowitz
Theoretical Computer Science
464
, 2012, pp. 35-47
Highlights in infinitary rewriting and lambda calculus
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
Theoretical Computer Science
464
, 2012, pp. 48-71
Determinization of conditional term rewriting systems
Masanori Nagashima
,
Masahiko Sakai
,
Toshiki Sakabe
Theoretical Computer Science
464
, 2012, pp. 72-89
Principles of proof scores in CafeOBJ
Kokichi Futatsugi
,
Daniel Gȃinȃ
,
Kazuhiro Ogata
Theoretical Computer Science
464
, 2012, pp. 90-112
Tracing where and who provenance in Linked Data: A calculus
Mariangiola Dezani-Ciancaglini
,
Ross Horne
,
Vladimiro Sassone
Theoretical Computer Science
464
, 2012, pp. 113-129