Algebra of Programming using Dependent Types
Dependent type theory is rich enough to express that a program satisfies an input/output relational specification, but it could be hard to construct the proof term. On the other hand, squiggolists know very well how to show that one relation is included in another by algebraic reasoning. We demonstr...
Main Authors: | , , |
---|---|
Format: | Conference item |
Published: |
Springer−Verlag
2008
|