Mercurial > urweb

annotate src/disjoint.sml @ 227:524e10c91478

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
GROUP BY and HAVING
author Adam Chlipala <adamc@hcoop.net>
date Thu, 21 Aug 2008 14:09:08 -0400
parents cc68da3801bc
children 326fb4686f60
rev   line source
adamc@82 1 (* Copyright (c) 2008, Adam Chlipala
adamc@82 2 * All rights reserved.
adamc@82 3 *
adamc@82 4 * Redistribution and use in source and binary forms, with or without
adamc@82 5 * modification, are permitted provided that the following conditions are met:
adamc@82 6 *
adamc@82 7 * - Redistributions of source code must retain the above copyright notice,
adamc@82 8 * this list of conditions and the following disclaimer.
adamc@82 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@82 10 * this list of conditions and the following disclaimer in the documentation
adamc@82 11 * and/or other materials provided with the distribution.
adamc@82 12 * - The names of contributors may not be used to endorse or promote products
adamc@82 13 * derived from this software without specific prior written permission.
adamc@82 14 *
adamc@82 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@82 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@82 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@82 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@82 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@82 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@82 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@82 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@82 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@82 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@82 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@82 26 *)
adamc@82 27
adamc@82 28 structure Disjoint :> DISJOINT = struct
adamc@82 29
adamc@82 30 open Elab
adamc@82 31 open ElabOps
adamc@82 32
adamc@207 33 datatype piece_fst =
adamc@82 34 NameC of string
adamc@82 35 | NameR of int
adamc@82 36 | NameN of int
adamc@88 37 | NameM of int * string list * string
adamc@82 38 | RowR of int
adamc@82 39 | RowN of int
adamc@88 40 | RowM of int * string list * string
adamc@88 41
adamc@207 42 type piece = piece_fst * int list
adamc@207 43
adamc@88 44 fun p2s p =
adamc@88 45 case p of
adamc@88 46 NameC s => "NameC(" ^ s ^ ")"
adamc@88 47 | NameR n => "NameR(" ^ Int.toString n ^ ")"
adamc@88 48 | NameN n => "NameN(" ^ Int.toString n ^ ")"
adamc@88 49 | NameM (n, _, s) => "NameR(" ^ Int.toString n ^ ", " ^ s ^ ")"
adamc@88 50 | RowR n => "RowR(" ^ Int.toString n ^ ")"
adamc@88 51 | RowN n => "RowN(" ^ Int.toString n ^ ")"
adamc@88 52 | RowM (n, _, s) => "RowR(" ^ Int.toString n ^ ", " ^ s ^ ")"
adamc@88 53
adamc@88 54 fun pp p = print (p2s p ^ "\n")
adamc@88 55
adamc@88 56 structure PK = struct
adamc@88 57
adamc@88 58 type ord_key = piece
adamc@88 59
adamc@207 60 open Order
adamc@88 61
adamc@207 62 fun compare' (p1, p2) =
adamc@88 63 case (p1, p2) of
adamc@88 64 (NameC s1, NameC s2) => String.compare (s1, s2)
adamc@88 65 | (NameR n1, NameR n2) => Int.compare (n1, n2)
adamc@88 66 | (NameN n1, NameN n2) => Int.compare (n1, n2)
adamc@88 67 | (NameM (n1, ss1, s1), NameM (n2, ss2, s2)) =>
adamc@88 68 join (Int.compare (n1, n2),
adamc@88 69 fn () => join (String.compare (s1, s2), fn () =>
adamc@88 70 joinL String.compare (ss1, ss2)))
adamc@88 71 | (RowR n1, RowR n2) => Int.compare (n1, n2)
adamc@88 72 | (RowN n1, RowN n2) => Int.compare (n1, n2)
adamc@88 73 | (RowM (n1, ss1, s1), RowM (n2, ss2, s2)) =>
adamc@88 74 join (Int.compare (n1, n2),
adamc@88 75 fn () => join (String.compare (s1, s2), fn () =>
adamc@88 76 joinL String.compare (ss1, ss2)))
adamc@88 77
adamc@88 78 | (NameC _, _) => LESS
adamc@88 79 | (_, NameC _) => GREATER
adamc@88 80
adamc@88 81 | (NameR _, _) => LESS
adamc@88 82 | (_, NameR _) => GREATER
adamc@88 83
adamc@88 84 | (NameN _, _) => LESS
adamc@88 85 | (_, NameN _) => GREATER
adamc@88 86
adamc@88 87 | (NameM _, _) => LESS
adamc@88 88 | (_, NameM _) => GREATER
adamc@88 89
adamc@88 90 | (RowR _, _) => LESS
adamc@88 91 | (_, RowR _) => GREATER
adamc@88 92
adamc@88 93 | (RowN _, _) => LESS
adamc@88 94 | (_, RowN _) => GREATER
adamc@88 95
adamc@207 96 fun compare ((p1, ns1), (p2, ns2)) =
adamc@207 97 join (compare' (p1, p2),
adamc@207 98 fn () => joinL Int.compare (ns1, ns2))
adamc@207 99
adamc@88 100 end
adamc@88 101
adamc@88 102 structure PS = BinarySetFn(PK)
adamc@88 103 structure PM = BinaryMapFn(PK)
adamc@88 104
adamc@88 105 type env = PS.set PM.map
adamc@88 106
adamc@90 107 type goal = ErrorMsg.span * ElabEnv.env * env * Elab.con * Elab.con
adamc@90 108
adamc@88 109 val empty = PM.empty
adamc@82 110
adamc@82 111 fun nameToRow (c, loc) =
adamc@82 112 (CRecord ((KUnit, loc), [((c, loc), (CUnit, loc))]), loc)
adamc@82 113
adamc@207 114 fun pieceToRow' (p, loc) =
adamc@82 115 case p of
adamc@82 116 NameC s => nameToRow (CName s, loc)
adamc@82 117 | NameR n => nameToRow (CRel n, loc)
adamc@82 118 | NameN n => nameToRow (CNamed n, loc)
adamc@88 119 | NameM (n, xs, x) => nameToRow (CModProj (n, xs, x), loc)
adamc@82 120 | RowR n => (CRel n, loc)
adamc@88 121 | RowN n => (CNamed n, loc)
adamc@88 122 | RowM (n, xs, x) => (CModProj (n, xs, x), loc)
adamc@88 123
adamc@207 124 fun pieceToRow ((p, ns), loc) =
adamc@207 125 foldl (fn (n, c) => (CProj (c, n), loc)) (pieceToRow' (p, loc)) ns
adamc@207 126
adamc@88 127 datatype piece' =
adamc@88 128 Piece of piece
adamc@88 129 | Unknown of con
adamc@82 130
adamc@207 131 fun pieceEnter' p =
adamc@88 132 case p of
adamc@88 133 NameR n => NameR (n + 1)
adamc@88 134 | RowR n => RowR (n + 1)
adamc@88 135 | _ => p
adamc@82 136
adamc@207 137 fun pieceEnter (p, n) = (pieceEnter' p, n)
adamc@207 138
adamc@88 139 fun enter denv =
adamc@88 140 PM.foldli (fn (p, pset, denv') =>
adamc@88 141 PM.insert (denv', pieceEnter p, PS.map pieceEnter pset))
adamc@88 142 PM.empty denv
adamc@82 143
adamc@82 144 fun prove1 denv (p1, p2) =
adamc@82 145 case (p1, p2) of
adamc@207 146 ((NameC s1, _), (NameC s2, _)) => s1 <> s2
adamc@88 147 | _ =>
adamc@88 148 case PM.find (denv, p1) of
adamc@88 149 NONE => false
adamc@88 150 | SOME pset => PS.member (pset, p2)
adamc@82 151
adamc@90 152 fun decomposeRow (env, denv) c =
adamc@82 153 let
adamc@207 154 fun decomposeProj c =
adamc@207 155 let
adamc@207 156 val (c, gs) = hnormCon (env, denv) c
adamc@207 157 in
adamc@207 158 case #1 c of
adamc@207 159 CProj (c, n) =>
adamc@207 160 let
adamc@207 161 val (c', ns, gs') = decomposeProj c
adamc@207 162 in
adamc@207 163 (c', ns @ [n], gs @ gs')
adamc@207 164 end
adamc@207 165 | _ => (c, [], gs)
adamc@207 166 end
adamc@207 167
adamc@90 168 fun decomposeName (c, (acc, gs)) =
adamc@90 169 let
adamc@207 170 val (cAll as (c, _), ns, gs') = decomposeProj c
adamc@90 171
adamc@90 172 val acc = case c of
adamc@207 173 CName s => Piece (NameC s, ns) :: acc
adamc@207 174 | CRel n => Piece (NameR n, ns) :: acc
adamc@207 175 | CNamed n => Piece (NameN n, ns) :: acc
adamc@207 176 | CModProj (m1, ms, x) => Piece (NameM (m1, ms, x), ns) :: acc
adamc@90 177 | _ => Unknown cAll :: acc
adamc@90 178 in
adamc@90 179 (acc, gs' @ gs)
adamc@90 180 end
adamc@90 181
adamc@90 182 fun decomposeRow (c, (acc, gs)) =
adamc@90 183 let
adamc@207 184 val (cAll as (c, _), ns, gs') = decomposeProj c
adamc@90 185 val gs = gs' @ gs
adamc@90 186 in
adamc@90 187 case c of
adamc@90 188 CRecord (_, xcs) => foldl (fn ((x, _), acc_gs) => decomposeName (x, acc_gs)) (acc, gs) xcs
adamc@90 189 | CConcat (c1, c2) => decomposeRow (c1, decomposeRow (c2, (acc, gs)))
adamc@207 190 | CRel n => (Piece (RowR n, ns) :: acc, gs)
adamc@207 191 | CNamed n => (Piece (RowN n, ns) :: acc, gs)
adamc@207 192 | CModProj (m1, ms, x) => (Piece (RowM (m1, ms, x), ns) :: acc, gs)
adamc@90 193 | _ => (Unknown cAll :: acc, gs)
adamc@90 194 end
adamc@90 195 in
adamc@90 196 decomposeRow (c, ([], []))
adamc@90 197 end
adamc@90 198
adamc@90 199 and assert env denv (c1, c2) =
adamc@90 200 let
adamc@90 201 val (ps1, gs1) = decomposeRow (env, denv) c1
adamc@90 202 val (ps2, gs2) = decomposeRow (env, denv) c2
adamc@90 203
adamc@90 204 val unUnknown = List.mapPartial (fn Unknown _ => NONE | Piece p => SOME p)
adamc@90 205 val ps1 = unUnknown ps1
adamc@90 206 val ps2 = unUnknown ps2
adamc@90 207
adamc@90 208 (*val () = print "APieces1:\n"
adamc@90 209 val () = app pp ps1
adamc@90 210 val () = print "APieces2:\n"
adamc@90 211 val () = app pp ps2*)
adamc@90 212
adamc@90 213 fun assertPiece ps (p, denv) =
adamc@90 214 let
adamc@90 215 val pset = Option.getOpt (PM.find (denv, p), PS.empty)
adamc@90 216 val ps = case p of
adamc@207 217 (NameC _, _) => List.filter (fn (NameC _, _) => false | _ => true) ps
adamc@90 218 | _ => ps
adamc@90 219 val pset = PS.addList (pset, ps)
adamc@90 220 in
adamc@90 221 PM.insert (denv, p, pset)
adamc@90 222 end
adamc@90 223
adamc@90 224 val denv = foldl (assertPiece ps2) denv ps1
adamc@90 225 in
adamc@90 226 (foldl (assertPiece ps1) denv ps2, gs1 @ gs2)
adamc@90 227 end
adamc@90 228
adamc@90 229 and prove env denv (c1, c2, loc) =
adamc@90 230 let
adamc@90 231 val (ps1, gs1) = decomposeRow (env, denv) c1
adamc@90 232 val (ps2, gs2) = decomposeRow (env, denv) c2
adamc@82 233
adamc@88 234 val hasUnknown = List.exists (fn Unknown _ => true | _ => false)
adamc@88 235 val unUnknown = List.mapPartial (fn Unknown _ => NONE | Piece p => SOME p)
adamc@82 236 in
adamc@82 237 if hasUnknown ps1 orelse hasUnknown ps2 then
adamc@90 238 [(loc, env, denv, c1, c2)]
adamc@82 239 else
adamc@88 240 let
adamc@88 241 val ps1 = unUnknown ps1
adamc@88 242 val ps2 = unUnknown ps2
adamc@88 243
adamc@88 244 in
adamc@88 245 (*print "Pieces1:\n";
adamc@88 246 app pp ps1;
adamc@88 247 print "Pieces2:\n";
adamc@88 248 app pp ps2;*)
adamc@88 249
adamc@88 250 foldl (fn (p1, rem) =>
adamc@88 251 foldl (fn (p2, rem) =>
adamc@88 252 if prove1 denv (p1, p2) then
adamc@88 253 rem
adamc@88 254 else
adamc@90 255 (loc, env, denv, pieceToRow (p1, loc), pieceToRow (p2, loc)) :: rem) rem ps2)
adamc@90 256 (gs1 @ gs2) ps1
adamc@88 257 end
adamc@82 258 end
adamc@82 259
adamc@90 260 and hnormCon (env, denv) c =
adamc@90 261 let
adamc@90 262 val cAll as (c, loc) = ElabOps.hnormCon env c
adamc@90 263
adamc@90 264 fun doDisj (c1, c2, c) =
adamc@90 265 let
adamc@90 266 val (c, gs) = hnormCon (env, denv) c
adamc@90 267 in
adamc@90 268 (c, prove env denv (c1, c2, loc) @ gs)
adamc@90 269 end
adamc@90 270 in
adamc@90 271 case c of
adamc@90 272 CDisjoint cs => doDisj cs
adamc@90 273 | TDisjoint cs => doDisj cs
adamc@90 274 | _ => (cAll, [])
adamc@90 275 end
adamc@90 276
adamc@82 277 end