75 search results - page 1 / 15 » Termination Analysis of Higher-Order Functional Programs |
APLAS
2005
ACM
14 years 4 months ago
2005
ACM
LISP
2008
13 years 11 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
FUIN
2006
13 years 11 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
POPL
2009
ACM
14 years 11 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
FROCOS
2011
Springer
12 years 10 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...