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...
Autori principali: | Ko, H, Gibbons, J |
---|---|
Natura: | Conference item |
Pubblicazione: |
ACM
2013
|
Documenti analoghi
Documenti analoghi
-
Programming with ornaments
di: Ko, H, et al.
Pubblicazione: (2016) -
Categorical organisation of the ornament–refinement framework
di: Ko, H, et al.
Pubblicazione: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
di: Gibbons, J, et al.
Pubblicazione: (2012) -
Relational algebra by way of adjunctions
di: Gibbons, J, et al.
Pubblicazione: (2018) -
Algebras for tree algorithms
di: Gibbons, J
Pubblicazione: (1991)