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)