Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
<p>Relational program derivation is the technique of stepwise refining a relational specification to a program by algebraic rules. The program thus obtained is correct by construction. Meanwhile, dependent type theory is rich enough to express various correctness properties to be verified by t...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
2009
|