Expression continuity and the formal differentiation of algorithms

  • Authors:
  • Bob Paige;J. T. Schwartz

  • Affiliations:
  • Courant Institute of Mathematical Sciences, New York University;Courant Institute of Mathematical Sciences, New York University

  • Venue:
  • POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

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 optimization as part of a compiling system.