Expression continuity and the formal differentiation of algorithms

Abstract

This paper explores the technique of 'strength reduction' or 'formal differentation' in a set theoretic context, as recently introduced by Earley. We give pragmatic rules for the recognition and treatment of reasonably general cases in which the optimization is applicable, and consider some of the problems which arise in actually attempting to install this… (More)
DOI: 10.1145/512950.512957

Topics

Cite this paper

@inproceedings{Paige1977ExpressionCA, title={Expression continuity and the formal differentiation of algorithms}, author={Bob Paige and J. T. Schwartz}, booktitle={POPL '77}, year={1977} }