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 |
---|---|
Format: | Conference item |
Published: |
ACM
2013
|
Similar Items
-
Programming with ornaments
by: Ko, H, et al.
Published: (2016) -
Categorical organisation of the ornament–refinement framework
by: Ko, H, et al.
Published: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
by: Gibbons, J, et al.
Published: (2012) -
Relational algebra by way of adjunctions
by: Gibbons, J, et al.
Published: (2018) -
Datatype ornamentation and the Dutch National Flag problem
by: Ko, H
Published: (2011)