Author of the publication

On-demand strategy annotations revisited: An improved on-demand evaluation strategy.

, , , and . Theor. Comput. Sci., 411 (2): 504-541 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Operational termination of conditional term rewriting systems., , and . Inf. Process. Lett., 95 (4): 446-453 (2005)On-demand strategy annotations revisited: An improved on-demand evaluation strategy., , , and . Theor. Comput. Sci., 411 (2): 504-541 (2010)mu-term: Verify Termination Properties Automatically (System Description)., and . IJCAR (2), volume 12167 of Lecture Notes in Computer Science, page 436-447. Springer, (2020)Polynomials over the reals in proofs of termination: from theory to practice.. RAIRO Theor. Informatics Appl., 39 (3): 547-586 (2005)Redundancy Analyses in Term Rewriting., , and . WFLP, page 309-323. (2000)Reduction strategies in rewriting and programming., and . J. Symb. Comput., 40 (1): 745-747 (2005)Applications and extensions of context-sensitive rewriting.. J. Log. Algebraic Methods Program., (2021)Rewriting-Based Navigation of Web Sites: Looking for Models and Logics.. WWV, volume 157 of Electronic Notes in Theoretical Computer Science, page 79-85. Elsevier, (2005)Termination of Rewriting With Strategy Annotations.. LPAR, volume 2250 of Lecture Notes in Computer Science, page 669-684. Springer, (2001)Strong and NV-sequentiality of constructor systems.. Inf. Process. Lett., 89 (4): 191-201 (2004)