Relational algebraic ornaments

@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

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Ornamental algebras, algebraic ornaments

  • C. McBride
  • To appear in Journal of Functional Programming,
  • 2011
Highly Influential
20 Excerpts

Towards a practical programming language based on dependent type theory

  • U. Norell
  • PhD thesis, Chalmers University of Technology,
  • 2007
Highly Influential
20 Excerpts

Similar Papers

Loading similar papers…