Proving correctness via free theorems: The case of the destroy/build-rule

Proving correctness via free theorems: The case of the destroy/build-rule (2008)

by Janis Voigtländer

Venue:	IN PARTIAL EVALUATION AND PROGRAM MANIPULATION, PROCEEDINGS
Citations:	5 - 4 self

User correction supplied by mph

Datum	Value	Source
TITLE	Proving correctness via free theorems: The case of the destroy/build-rule	INFERENCE
AUTHOR NAME	Janis Voigtländer	user correction
AUTHOR AFFIL	Institut für Theoretische Informatik, Technische Universität Dresden	user correction
AUTHOR ADDR	01062 Dresden, Germany	user correction
ABSTRACT	Free theorems feature prominently in the field of program transformation for pure functional languages such as Haskell. However, somewhat disappointingly, the semantic properties of so based transformations are often established only very superficially. This paper is intended as a case study showing how to use the existing theoretical foundations and formal methods for improving the situation. To that end, we investigate the correctness issue for a new transformation rule in the short cut fusion family. This destroy/build-rule provides a certain reconciliation between the competing foldr/build- and destroy/unfoldr-approaches to eliminating intermediate lists. Our emphasis is on systematically and rigorously developing the rule’s correctness proof, even while paying attention to semantic aspects like potential nontermination and mixed strict/nonstrict evaluation.	SVM HeaderParse 0.2
YEAR	2008	user correction
VENUE	IN PARTIAL EVALUATION AND PROGRAM MANIPULATION, PROCEEDINGS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	13--20	INFERENCE
CITATIONS	19 found	ParsCit 1.0