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...
Үндсэн зохиолчид: | Ko, H, Gibbons, J |
---|---|
Формат: | Conference item |
Хэвлэсэн: |
ACM
2013
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Programming with ornaments
-н: Ko, H, зэрэг
Хэвлэсэн: (2016) -
Categorical organisation of the ornament–refinement framework
-н: Ko, H, зэрэг
Хэвлэсэн: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
-н: Gibbons, J, зэрэг
Хэвлэсэн: (2012) -
Relational algebra by way of adjunctions
-н: Gibbons, J, зэрэг
Хэвлэсэн: (2018) -
Algebras for tree algorithms
-н: Gibbons, J
Хэвлэсэн: (1991)