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 |
Izdano: |
ACM
2013
|
Podobne knjige/članki
-
Programming with ornaments
od: Ko, H, et al.
Izdano: (2016) -
Categorical organisation of the ornament–refinement framework
od: Ko, H, et al.
Izdano: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
od: Gibbons, J, et al.
Izdano: (2012) -
Relational algebra by way of adjunctions
od: Gibbons, J, et al.
Izdano: (2018) -
Algebras for tree algorithms
od: Gibbons, J
Izdano: (1991)