21 search results - page 1 / 5 » Improving Programs Which Recurse over Multiple Inductive Str... |
PEPM
1994
ACM
13 years 9 months ago
1994
ACM
TACAS
2010
Springer
13 years 12 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
JLP
2007
13 years 4 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
AAECC
2007
Springer
13 years 5 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
TLCA
2007
Springer
13 years 11 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...