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...
Principais autores: | Ko, H, Gibbons, J |
---|---|
Formato: | Conference item |
Publicado em: |
ACM
2013
|
Registros relacionados
-
Programming with ornaments
por: Ko, H, et al.
Publicado em: (2016) -
Categorical organisation of the ornament–refinement framework
por: Ko, H, et al.
Publicado em: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
por: Gibbons, J, et al.
Publicado em: (2012) -
Relational algebra by way of adjunctions
por: Gibbons, J, et al.
Publicado em: (2018) -
Algebras for tree algorithms
por: Gibbons, J
Publicado em: (1991)