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)