Matthias Raffelsieper

 

Improving efficiency and power of automatedtermination analysis for Haskell (intermed. Diploma presentation)

Abstract:

 

Termination analysis of Haskell programs is especially interesting, as
Haskell has a lazy evaluation strategy and allows for higher order
functions. Previously, an approach for Haskell termination analysis has
been developed. The talk will show how type information can be encoded
into the generated DP problems, such that the previously shown results
on minimality and innermost still hold. An evaluation of these results
shows, that by using these improvements, the Haskell termination
analysis becomes much more powerful.
Furthermore, the concept of Lazy-Termination is presented and it is
shown that it can be reduced to termination analysis. Finally, a
Non-Termination analysis for Haskell is introduced, which is built in
such a way that it reuses some parts of the analysis for termination.