#### Filter Results:

#### Publication Year

2014

2015

#### Key Phrase

#### Publication Venue

Learn More

The present paper shows how the idea of equality saturation can be used to prove algebraic properties of programs written in a non-total non-strict first-order functional language. We adapt equality saturation approach to a functional language by using transformations borrowed mainly from supercompilation. Proof by induction is performed via a special… (More)

The present paper shows how the idea of equality saturation can be used to build an inductive prover for a non-total first-order lazy functional language. We adapt equality saturation approach to a functional language by using transformations borrowed from supercom-pilation. A special transformation called merging by bisimilarity is used to perform proof by… (More)

- ‹
- 1
- ›