Sergei A. Grechanik

Learn More
In this paper we present a new approach to multi-result su-percompilation based on joining together process graphs into a single graph and welding nodes corresponding to equal configurations. We show that this leads to a considerable reduction of nodes being built during su-percompilation and enables more efficient configuration graph processing algorithms(More)
This paper presents a reformulation of the notion of multi-result supercompilation in terms of graph transformations. For this purpose we use a hypergraph-based representation of the program being transformed. The presented approach bridges the gap between supercompilation and equality saturation. We also show how higher-level supercompilation naturally(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)
When applying supercompilation to problem-solving, multi-result supercompila-tion enables us to find the best solutions by generating a set of possible residual graphs of configurations that are then filtered according to some criteria. Unfortunately , the search space may be rather large. However, we show that the search can be drastically reduced by(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)
  • 1