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...
Autors principals: | Ko, H, Gibbons, J |
---|---|
Format: | Conference item |
Publicat: |
ACM
2013
|
Ítems similars
-
Programming with ornaments
per: Ko, H, et al.
Publicat: (2016) -
Categorical organisation of the ornament–refinement framework
per: Ko, H, et al.
Publicat: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
per: Gibbons, J, et al.
Publicat: (2012) -
Relational algebra by way of adjunctions
per: Gibbons, J, et al.
Publicat: (2018) -
Algebras for tree algorithms
per: Gibbons, J
Publicat: (1991)