Skript (Fassung vom 4.4.2011) - Lehr- und Forschungsgebiet ...
Skript (Fassung vom 4.4.2011) - Lehr- und Forschungsgebiet ...
Skript (Fassung vom 4.4.2011) - Lehr- und Forschungsgebiet ...
Sie wollen auch ein ePaper? Erhöhen Sie die Reichweite Ihrer Titel.
YUMPU macht aus Druck-PDFs automatisch weboptimierte ePaper, die Google liebt.
[DJ90]<br />
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Formal Models and Semantics,<br />
volume B of Handbook of Theoretical Computer Science, J. van Leeuwen<br />
(ed.), pages 243–320. North-Holland, 1990.<br />
[DF85] D. Detlefs and R. Forgaard. A procedure for automatically proving the termination<br />
of a set of rewrite rules. In Proceedings of the First International Conference<br />
on Rewriting Techniques and Applications, RTA-85,Dijon,France, LectureNotes<br />
in Computer Science, 1985.<br />
[DST80] P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression<br />
problem. Journal of the ACM, 27(4):758-771, 1980.<br />
[Gie95] J. Giesl. Generating polynomial orderings for termination proofs. In Proceedings<br />
of the 6th International Conference on Rewriting Techniques and Applications,<br />
RTA-95,Kaiserslautern, Germany,LectureNotesinComputerScience 914,pages<br />
426-431, 1995.<br />
[Gie03] J. Giesl. Automatisierte Programmverifikation. <strong>Skript</strong> zur Vorlesung, RWTH<br />
Aachen, 2003.<br />
[Gie05] J. Giesl. Gr<strong>und</strong>lagen der Funktionalen Programmierung. <strong>Skript</strong> zur Vorlesung,<br />
RWTH Aachen, 2005.<br />
[Gie06] J. Giesl. Logikprogrammierung. <strong>Skript</strong> zur Vorlesung, RWTH Aachen, 2010.<br />
[Her71] G.T.Herman.Strongcomputabilityandvariantsoftheuniformhaltingproblem.<br />
Z. Math. Logik Gr<strong>und</strong>l. Math., 17:115-131, 1971.<br />
[HL78]<br />
G. Huet and J.-J. Lévy. On the uniform halting problem for term rewriting<br />
systems. Technical Report 283, INRIA, 1978.<br />
[Hue80] G. Huet. Confluent reductions: Abstract properties and applications to term<br />
rewriting systems. Journal of the ACM, 27(4):797-821, 1980.<br />
[HH82] G. Huet and J.-M. Hullot. Proof by induction in equational theories with constructors.<br />
Journal of Computer and System Sciences, 25:239-266, 1982.<br />
[KL80]<br />
S. Kamin and J.-J. Lévy. Two generalizations of recursive path orderings. Unpublished<br />
note, Dept. of Computer Science, University of Illinois, Urbana, IL, USA,<br />
1980.<br />
[KM87] D. Kapur and D. R. Musser. Proof by consistency. Artificial Intelligence, 31:125–<br />
158, 1987.<br />
[KZ95]<br />
D. Kapur and H. Zhang. An overview of rewrite rule laboratory (rrl). Journal<br />
of Computer and Mathematics with Applications, 29:91–114, 1995.<br />
[KB70] D. E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In<br />
Computational Problems in Abstract Algebra, J. Leech (ed.), pp. 263-297, Pergamon<br />
Press, 1970.
Change language