Copenhagen Programming Language Seminar
The "size-change" approach to detecting program termination (reported at POPL 2001) is easily automated, and fairly general in that it can, without special treatment, handle programs with permuted parameters and mutual recursion. Its computational aspects are well-understood: The analysis itself has worst-case PSPACE complexity but seems to work well in practice. As to the method's power, a function is computable by a size-change terminating program iff it is multiple recursive (in the sense of R. Peter).
Andrzej Filinski. Administrative host: Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU and KVL.
To receive information about COPLAS talks by email, send a message to email@example.com with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org