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...
Main Authors: | Ko, H, Gibbons, J |
---|---|
格式: | Conference item |
出版: |
ACM
2013
|
相似書籍
-
Programming with ornaments
由: Ko, H, et al.
出版: (2016) -
Categorical organisation of the ornament–refinement framework
由: Ko, H, et al.
出版: (2013) -
Relating Algebraic and Coalgebraic Descriptions of Lenses
由: Gibbons, J, et al.
出版: (2012) -
Relational algebra by way of adjunctions
由: Gibbons, J, et al.
出版: (2018) -
Algebras for tree algorithms
由: Gibbons, J
出版: (1991)