Relational algebraic ornaments

<p>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 <em>algebraic ornamentation</em> provides a meth...

全面介紹

書目詳細資料
Main Authors: Ko, H, Gibbons, J
格式: Conference item
出版: ACM 2013

相似書籍