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)