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...
Auteurs principaux: | Ko, H, Gibbons, J |
---|---|
Format: | Conference item |
Publié: |
ACM
2013
|
Documents similaires
-
Programming with ornaments
par: Ko, H, et autres
Publié: (2016) -
Categorical organisation of the ornament–refinement framework
par: Ko, H, et autres
Publié: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
par: Gibbons, J, et autres
Publié: (2012) -
Relational algebra by way of adjunctions
par: Gibbons, J, et autres
Publié: (2018) -
Algebras for tree algorithms
par: Gibbons, J
Publié: (1991)