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...
Príomhchruthaitheoirí: | Ko, H, Gibbons, J |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
ACM
2013
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Programming with ornaments
de réir: Ko, H, et al.
Foilsithe / Cruthaithe: (2016) -
Categorical organisation of the ornament–refinement framework
de réir: Ko, H, et al.
Foilsithe / Cruthaithe: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
de réir: Gibbons, J, et al.
Foilsithe / Cruthaithe: (2012) -
Relational algebra by way of adjunctions
de réir: Gibbons, J, et al.
Foilsithe / Cruthaithe: (2018) -
Algebras for tree algorithms
de réir: Gibbons, J
Foilsithe / Cruthaithe: (1991)