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...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
ACM
2013
|