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...
| 主要な著者: | , |
|---|---|
| フォーマット: | Conference item |
| 出版事項: |
ACM
2013
|