Proving the Equivalence of Higher-Order Terms by Means of Supercompilation

@inproceedings{Klyuchnikov2009ProvingTE,
  title={Proving the Equivalence of Higher-Order Terms by Means of Supercompilation},
  author={Ilya G. Klyuchnikov and Sergei A. Romanenko},
  booktitle={Ershov Memorial Conference},
  year={2009}
}
One of the applications of supercompilation is proving properties of programs. We focus in this paper on a specific task: proving term equivalence for a higher-order lazy functional language. The “classical” way to prove equivalence of two terms t1 and t2 is to write an equality function equals and to simplify the term (equals t1 t2). However, this works only when certain conditions are met. The paper presents another approach to proving term equivalence by means of supercompilation. In this… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
21 Citations
18 References
Similar Papers

Similar Papers

Loading similar papers…