| | |
Summary: Verifying a Semantic -Conversion Test
for Martin-L¨of Type Theory
Andreas Abel1
Thierry Coquand2 Peter Dybjer2
1Ludwig-Maximilians-University Munich
2Chalmers University of Technology
Mathematics of Program Construction
Marseille, France
18 July 2008
Abel Coquand Dybjer (LMU, CTH) Semantic -Conversion DTP'08 1 / 27
Background
Dependently typed languages allow specification, implementation,
and verification in the same language.
Strong data invariants.
Pre- and post-conditions.
Soundness.
Programs (e.g., add) can occur in types of other programs (e.g.,
append).
append : (n m : Nat) -> Vec n -> Vec m -> Vec (add n m)
Type equality can be established
|
