@inproceedings{Ko2013RelationalAO,
title={Relational algebraic ornaments},
author={Hsiang-Shang Ko and Jeremy Gibbons},
booktitle={DTP@ICFP},
year={2013}
}

Dependently typed programming is hard, because ideally dependently typed programs should share structure with their correctness proofs, but there are very few guidelines on how one can arrive at such integrated programs. McBride's algebraic ornamentation provides a methodological advancement, by which the programmer can derive a datatype from a specification involving a fold, such that a program that constructs elements of that datatype would be correct by construction. It is thus an effective… CONTINUE READING