Abstract
Proof by mathematical induction plays a crucial role in reasoning about functional programs. A generalization step often holds the key to discovering an inductive proof. We present a generalization technique which is particularly applicable when reasoning about functional programs involving accumulating parameters. We provide empirical evidence for the success of our technique and show how it is contributing to the ongoing development of a parallelizing compiler for Standard ML.
Original language | English |
---|---|
Pages (from-to) | 225-245 |
Number of pages | 21 |
Journal | Journal of Functional Programming |
Volume | 9 |
Issue number | 2 |
Publication status | Published - Mar 1999 |