F. Baader
T. Nipkow
1998
Term Rewriting and All That
Cambridge University Press
http://dx.doi.org/10.2277/0521779200
J. Endrullis
2010
Termination and Productivity
Vrije Universiteit Amsterdam
http://hdl.handle.net/1871/15879
J. Endrullis
C. Grabmayer
D. Hendriks
2008
Data-oblivious Stream Productivity
Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08)
Lecture Notes in Computer Science
5330
Springer-Verlag
79–96
http://dx.doi.org/10.1007/978-3-540-89439-1_6
Web interface tool: http://infinity.few.vu.nl/productivity/
J. Endrullis
C. Grabmayer
D. Hendriks
2009
Complexity of Fractran and Productivity
Proceedings of the 22nd Conference on Automated Deduction (CADE'09)
Lecture Notes in Computer Science
5663
Springer-Verlag
371–387
http://dx.doi.org/10.1007/978-3-642-02959-2_28
J. Endrullis
D. Hendriks
2011
Lazy Productivity via Termination
Theoretical Computer Science
412
28
3203–3225
http://dx.doi.org/10.1016/j.tcs.2011.03.024
J. Giesl
P. Schneider-Kamp
R. Thiemann
2006
AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
Proceedings of the 3rd International Joint Conference on Automatic Reasoning (IJCAR'06)
Lecture Notes in Computer Science
4130
Springer-Verlag
281–286
http://dx.doi.org/10.1007/11814771_24
Web interface tool: http://aprove.informatik.rwth-aachen.de
S. Lucas
1998
Context-sensitive Computations in Functional and Functional Logic Programs
Journal of Functional and Logic Programming
1998
1
http://mitpress.mit.edu/e-journals/JFLP/articles/1998/A98-01/A98-01.html
S. Lucas
2002
Context-Sensitive Rewrite Strategies
Information and Computation
178
1
294–343
http://dx.doi.org/10.1006/inco.2002.3176
Nangate Inc.
2008
Open Cell Library v2008_10 SP1
http://www.nangate.com/openlibrary/
S. Peyton Jones
2003
Haskell 98 Language and Libraries: The Revised Report
Cambridge University Press
http://www.haskell.org/definition
Terese
2003
Term Rewriting Systems
Cambridge Tracts in Theoretical Computer Science
55
Cambridge University Press
Cambridge, UK
http://dx.doi.org/10.2277/0521391156
H. Zantema
2008
Normalization of Infinite Terms
Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA'08)
Lecture Notes in Computer Science
5117
Springer-Verlag
441–455
http://dx.doi.org/10.1007/978-3-540-70590-1_30
H. Zantema
2009
Well-definedness of Streams by Termination
Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09)
Lecture Notes in Computer Science
5595
Springer-Verlag
164–178
http://dx.doi.org/10.1007/978-3-642-02348-4_12
H. Zantema
M. Raffelsieper
2010
Proving Productivity in Infinite Data Structures
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA'10)
Leibniz International Proceedings in Informatics (LIPIcs)
6
Schloss Dagstuhl–Leibniz-Zentrum für Informatik
401–416
http://dx.doi.org/10.4230/LIPIcs.RTA.2010.401
H. Zantema
M. Raffelsieper
2010
Stream Productivity by Outermost Termination
Proceedings of the 9th International Workshop in Reduction Strategies in Rewriting and Programming (WRS'09)
Electronic Proceedings in Theoretical Computer Science
15
http://dx.doi.org/10.4204/EPTCS.15.7