@article{BurstallD77,
	title = {A Transformation System for Developing Recursive Programs},
	address = {New York, NY, USA},
	author = {R. M. Burstall and John Darlington},
	journal = {Journal of the ACM},
	number = {1},
	pages = {44--67},
	publisher = {ACM},
	url = {http://doi.acm.org/10.1145/321992.321996},
	volume = {24},
	year = {1977},
	biburl = {http://www.bibsonomy.org/bibtex/2c349036a318c23ef196b0e64b5735c22/emanuel},
	description = {A Transformation System for Developing Recursive Programs},
	abstract = {A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, lucid, and hopefully correct program is transformed into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program-manipulation system is indicated.},
	keywords = {article ase deductive_program_synthesis program_optimisation program_synthesis program_transformation }
}