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 |
Udgivet: |
ACM
2013
|
Lignende værker
-
Programming with ornaments
af: Ko, H, et al.
Udgivet: (2016) -
Categorical organisation of the ornament–refinement framework
af: Ko, H, et al.
Udgivet: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
af: Gibbons, J, et al.
Udgivet: (2012) -
Relational algebra by way of adjunctions
af: Gibbons, J, et al.
Udgivet: (2018) -
Algebras for tree algorithms
af: Gibbons, J
Udgivet: (1991)