Copenhagen Programming Language Seminar
One of the applications of supercompilation is proving properties of programs. We focus in this presentation on a certain task: proving term equivalence for a higher-order lazy functional language. The "classical" way to prove the equivalence of two terms x and y is to write an equality function and to simplify the term equal(x,y). A different approach for proving terms equivalence by the means of supercompilation is suggested. In this approach we supercompile both terms and compare them. Applications of this approach are discussed.
Scientific host:Robert Glück Administrative host:
All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU, KVL and RUC.
COPLAS is sponsored by the FIRST Graduate School.
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