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...
Prif Awduron: | Ko, H, Gibbons, J |
---|---|
Fformat: | Conference item |
Cyhoeddwyd: |
ACM
2013
|
Eitemau Tebyg
-
Programming with ornaments
gan: Ko, H, et al.
Cyhoeddwyd: (2016) -
Categorical organisation of the ornament–refinement framework
gan: Ko, H, et al.
Cyhoeddwyd: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
gan: Gibbons, J, et al.
Cyhoeddwyd: (2012) -
Relational algebra by way of adjunctions
gan: Gibbons, J, et al.
Cyhoeddwyd: (2018) -
Algebras for tree algorithms
gan: Gibbons, J
Cyhoeddwyd: (1991)