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...
Hlavní autoři: | Ko, H, Gibbons, J |
---|---|
Médium: | Conference item |
Vydáno: |
ACM
2013
|
Podobné jednotky
-
Programming with ornaments
Autor: Ko, H, a další
Vydáno: (2016) -
Categorical organisation of the ornament–refinement framework
Autor: Ko, H, a další
Vydáno: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
Autor: Gibbons, J, a další
Vydáno: (2012) -
Relational algebra by way of adjunctions
Autor: Gibbons, J, a další
Vydáno: (2018) -
Algebras for tree algorithms
Autor: Gibbons, J
Vydáno: (1991)