Sergei A. Grechanik

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn 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