view tests/cfold_disj.ur @ 819:cb30dd2ba353

Switch to Maranget's pattern exhaustiveness algorithm
author Adam Chlipala <adamc@hcoop.net>
date Sat, 23 May 2009 09:45:02 -0400
parents 71bafe66dbe1
children
line wrap: on
line source
con id = fold (fn nm => fn t :: Type => fn acc => [nm] ~ acc => [nm = t] ++ acc) []

con idT = id [D = int, E = float]

val idV = fn x : $idT => x.E