|
[2013]
|
Manfred
Schmidt-Schauß,
Conrad
Rau, and
David
Sabel.
Algorithms for Extended Alpha-Equivalence and Complexity.
In Femke van Raamsdonk, editor, 24th International Conference on
Rewriting Techniques and Applications (RTA 2013), volume 21 of Leibniz
International Proceedings in Informatics (LIPIcs), pages 255-270, Dagstuhl,
Germany, June 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[ bib |
DOI |
PDF |
http ]
|
|
[2012]
|
Conrad
Rau,
David
Sabel, and
Manfred
Schmidt-Schauß.
Correctness of program transformations as a termination problem.
In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors,
Automated Reasoning - Proceedings of the 6th International Joint Conference,
IJCAR 2012, Manchester, UK, June 26-29, 2012, volume 7364 of Lecture
Notes in Computer Science, pages 462-476. Springer Berlin / Heidelberg,
June 2012.
©Springer Verlag,
The original
publication is available at www.springerlink.com.
[ bib |
slides (IJCAR 2012) |
PDF ]
|
|
[2012]
|
Conrad
Rau,
David
Sabel, and
Manfred
Schmidt-Schauß.
Encoding induction in correctness proofs of program transformations
as a termination problem.
In Georg Moser, editor, 12th International Workshop on
Termination, WST 2012, February 19-23, 2012, Obergurgl, Austria, pages
74-78, February 2012.
Published online and open access by G. Moser, Institute of Computer
Science, University of Innsbruck, Austria.
[ bib |
Online Proceedings |
slides (WST 2012) |
PDF ]
|
|
[2011]
|
Conrad
Rau and
Manfred
Schmidt-Schauß.
Computing overlappings by unification in the deterministic lambda
calculus lr with letrec, case, constructors, seq and variable chains.
Frank
report 46, Institut für Informatik. Fachbereich Informatik und
Mathematik. Goethe-Universität Frankfurt am Main, August 2011.
[ bib |
PDF ]
|
|
[2011]
|
Conrad
Rau and
Manfred
Schmidt-Schauß.
A unification algorithm to compute overlaps in a call-by-need
lambda-calculus with variable-binding chains.
In Proceedings of the 25th International Workshop on
Unification, pages 35-41, July 2011.
[ bib |
PDF |
http ]
|
|
[2011]
|
Conrad
Rau and
Manfred
Schmidt-Schauß.
Towards correctness of program transformations through unification
and critical pair computation.
Frank
report 41, Institut für Informatik. Fachbereich Informatik und
Mathematik. Goethe-Universität Frankfurt am Main, January 2011.
[ bib |
PDF |
previous version ]
|
|
[2010]
|
Conrad
Rau and
Manfred
Schmidt-Schauß.
Towards correctness of program transformations through unification
and critical pair computation.
In Proceedings of the 24th International Workshop on
Unification, volume 42 of Electronic Proceedings in Theoretical
Computer Science, pages 39-54, December 2010.
[ bib |
PDF ]
|
This file was generated by
bibtex2html 1.97.
|