The essence of ornaments

@article{Dagand2017TheEO,
  title={The essence of ornaments},
  author={Pierre-{\'E}variste Dagand},
  journal={Journal of Functional Programming},
  year={2017},
  volume={27}
}
Abstract Functional programmers from all horizons strive to use, and sometimes abuse, their favorite type system in order to capture the invariants of their programs. A widely used tool in that trade consists in defining finely indexed datatypes. Operationally, these types classify the programmer's data, following the ML tradition. Logically, these types enforce the program invariants in a novel manner. This new programming pattern, by which one programs over inductive definitions to account… Expand
9 Citations
Deferring the details and deriving programs
Ornaments for Proof Reuse in Coq
  • 8
  • PDF
Adapting proof automation to adapt proofs
  • 12
  • PDF
Demo: counterpoint by construction
QED at Large: A Survey of Engineering of Formally Verified Software
  • 15
  • Highly Influenced
  • PDF

References

SHOWING 1-10 OF 48 REFERENCES
Relational algebraic ornaments
  • 16
  • PDF
A Categorical Treatment of Ornaments
  • 21
  • PDF
Ornamental Algebras, Algebraic Ornaments
  • 57
  • PDF
Transporting functions across ornaments
  • 47
  • PDF
Ornaments in practice
  • 16
  • PDF
Constructing Universes for Generic Programming
  • 33
Analysis and synthesis of inductive families
  • 5
Purely functional data structures
  • 662
  • PDF
Refinement types for ML
  • 417
  • PDF
The category-theoretic solution of recursive domain equations
  • M. Smyth, G. Plotkin
  • Mathematics, Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
  • 585
  • PDF
...
1
2
3
4
5
...