pdf-format: |
|
@InProceedings{kop:LIPIcs:2020:12358, author = {Cynthia Kop}, title = {{WANDA - a Higher Order Termination Tool (System Description)}}, booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)}, pages = {36:1--36:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-155-9}, ISSN = {1868-8969}, year = {2020}, volume = {167}, editor = {Zena M. Ariola}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12358}, URN = {urn:nbn:de:0030-drops-123587}, doi = {10.4230/LIPIcs.FSCD.2020.36}, annote = {Keywords: higher-order term rewriting, termination, automatic analysis, dependency pair framework, higher-order recursive path ordering} }
Keywords: | higher-order term rewriting, termination, automatic analysis, dependency pair framework, higher-order recursive path ordering | |
Seminar: | 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020) | |
Issue date: | 2020 | |
Date of publication: | 28.06.2020 | |
Supplementary Material: | A detailed experimental evaluation and the snapshot of Wanda used in this paper are available from: https://www.cs.ru.nl/~cynthiakop/experiments/fscd20. |