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...
Päätekijät: | Ko, H, Gibbons, J |
---|---|
Aineistotyyppi: | Conference item |
Julkaistu: |
ACM
2013
|
Samankaltaisia teoksia
-
Programming with ornaments
Tekijä: Ko, H, et al.
Julkaistu: (2016) -
Categorical organisation of the ornament–refinement framework
Tekijä: Ko, H, et al.
Julkaistu: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
Tekijä: Gibbons, J, et al.
Julkaistu: (2012) -
Relational algebra by way of adjunctions
Tekijä: Gibbons, J, et al.
Julkaistu: (2018) -
Algebras for tree algorithms
Tekijä: Gibbons, J
Julkaistu: (1991)