annotate 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
rev   line source
adamc@90 1 con id = fold (fn nm => fn t :: Type => fn acc => [nm] ~ acc => [nm = t] ++ acc) []
adamc@90 2
adamc@90 3 con idT = id [D = int, E = float]
adamc@90 4
adamc@90 5 val idV = fn x : $idT => x.E