Sep 7, 2014
Refinement types do exhaustiveness checking!
The partial cases are assigned logical goal False, and the SMT solver needs to show they are not possible. This is one of the reasons I now believe in refinement types...
seen from Malaysia
seen from United Kingdom
seen from China
seen from United States
seen from United Kingdom
seen from United States
seen from China
seen from Netherlands
seen from Malaysia
seen from Israel
seen from United States
seen from China
seen from Austria
seen from Japan
seen from Poland
seen from China
seen from Austria
seen from China
seen from China
seen from China
Refinement types do exhaustiveness checking!
The partial cases are assigned logical goal False, and the SMT solver needs to show they are not possible. This is one of the reasons I now believe in refinement types...