Mercurial > urweb

annotate src/disjoint.sml @ 157:adc4e42e3adc

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Basic datatype importing works
author Adam Chlipala <adamc@hcoop.net>
date Thu, 24 Jul 2008 15:49:30 -0400
parents 94ef20a31550
children cc68da3801bc
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@82 33 datatype piece =
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@88 42 fun p2s p =
adamc@88 43 case p of
adamc@88 44 NameC s => "NameC(" ^ s ^ ")"
adamc@88 45 | NameR n => "NameR(" ^ Int.toString n ^ ")"
adamc@88 46 | NameN n => "NameN(" ^ Int.toString n ^ ")"
adamc@88 47 | NameM (n, _, s) => "NameR(" ^ Int.toString n ^ ", " ^ s ^ ")"
adamc@88 48 | RowR n => "RowR(" ^ Int.toString n ^ ")"
adamc@88 49 | RowN n => "RowN(" ^ Int.toString n ^ ")"
adamc@88 50 | RowM (n, _, s) => "RowR(" ^ Int.toString n ^ ", " ^ s ^ ")"
adamc@88 51
adamc@88 52 fun pp p = print (p2s p ^ "\n")
adamc@88 53
adamc@88 54 structure PK = struct
adamc@88 55
adamc@88 56 type ord_key = piece
adamc@88 57
adamc@88 58 fun join (o1, o2) =
adamc@88 59 case o1 of
adamc@88 60 EQUAL => o2 ()
adamc@88 61 | v => v
adamc@88 62
adamc@88 63 fun joinL f (os1, os2) =
adamc@88 64 case (os1, os2) of
adamc@88 65 (nil, nil) => EQUAL
adamc@88 66 | (nil, _) => LESS
adamc@88 67 | (h1 :: t1, h2 :: t2) =>
adamc@88 68 join (f (h1, h2), fn () => joinL f (t1, t2))
adamc@88 69 | (_ :: _, nil) => GREATER
adamc@88 70
adamc@88 71 fun compare (p1, p2) =
adamc@88 72 case (p1, p2) of
adamc@88 73 (NameC s1, NameC s2) => String.compare (s1, s2)
adamc@88 74 | (NameR n1, NameR n2) => Int.compare (n1, n2)
adamc@88 75 | (NameN n1, NameN n2) => Int.compare (n1, n2)
adamc@88 76 | (NameM (n1, ss1, s1), NameM (n2, ss2, s2)) =>
adamc@88 77 join (Int.compare (n1, n2),
adamc@88 78 fn () => join (String.compare (s1, s2), fn () =>
adamc@88 79 joinL String.compare (ss1, ss2)))
adamc@88 80 | (RowR n1, RowR n2) => Int.compare (n1, n2)
adamc@88 81 | (RowN n1, RowN n2) => Int.compare (n1, n2)
adamc@88 82 | (RowM (n1, ss1, s1), RowM (n2, ss2, s2)) =>
adamc@88 83 join (Int.compare (n1, n2),
adamc@88 84 fn () => join (String.compare (s1, s2), fn () =>
adamc@88 85 joinL String.compare (ss1, ss2)))
adamc@88 86
adamc@88 87 | (NameC _, _) => LESS
adamc@88 88 | (_, NameC _) => GREATER
adamc@88 89
adamc@88 90 | (NameR _, _) => LESS
adamc@88 91 | (_, NameR _) => GREATER
adamc@88 92
adamc@88 93 | (NameN _, _) => LESS
adamc@88 94 | (_, NameN _) => GREATER
adamc@88 95
adamc@88 96 | (NameM _, _) => LESS
adamc@88 97 | (_, NameM _) => GREATER
adamc@88 98
adamc@88 99 | (RowR _, _) => LESS
adamc@88 100 | (_, RowR _) => GREATER
adamc@88 101
adamc@88 102 | (RowN _, _) => LESS
adamc@88 103 | (_, RowN _) => GREATER
adamc@88 104
adamc@88 105 end
adamc@88 106
adamc@88 107 structure PS = BinarySetFn(PK)
adamc@88 108 structure PM = BinaryMapFn(PK)
adamc@88 109
adamc@88 110 type env = PS.set PM.map
adamc@88 111
adamc@90 112 type goal = ErrorMsg.span * ElabEnv.env * env * Elab.con * Elab.con
adamc@90 113
adamc@88 114 val empty = PM.empty
adamc@82 115
adamc@82 116 fun nameToRow (c, loc) =
adamc@82 117 (CRecord ((KUnit, loc), [((c, loc), (CUnit, loc))]), loc)
adamc@82 118
adamc@82 119 fun pieceToRow (p, loc) =
adamc@82 120 case p of
adamc@82 121 NameC s => nameToRow (CName s, loc)
adamc@82 122 | NameR n => nameToRow (CRel n, loc)
adamc@82 123 | NameN n => nameToRow (CNamed n, loc)
adamc@88 124 | NameM (n, xs, x) => nameToRow (CModProj (n, xs, x), loc)
adamc@82 125 | RowR n => (CRel n, loc)
adamc@88 126 | RowN n => (CNamed n, loc)
adamc@88 127 | RowM (n, xs, x) => (CModProj (n, xs, x), loc)
adamc@88 128
adamc@88 129 datatype piece' =
adamc@88 130 Piece of piece
adamc@88 131 | Unknown of con
adamc@82 132
adamc@88 133 fun pieceEnter p =
adamc@88 134 case p of
adamc@88 135 NameR n => NameR (n + 1)
adamc@88 136 | RowR n => RowR (n + 1)
adamc@88 137 | _ => p
adamc@82 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@82 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@90 154 fun decomposeName (c, (acc, gs)) =
adamc@90 155 let
adamc@90 156 val (cAll as (c, _), gs') = hnormCon (env, denv) c
adamc@90 157
adamc@90 158 val acc = case c of
adamc@90 159 CName s => Piece (NameC s) :: acc
adamc@90 160 | CRel n => Piece (NameR n) :: acc
adamc@90 161 | CNamed n => Piece (NameN n) :: acc
adamc@90 162 | CModProj (m1, ms, x) => Piece (NameM (m1, ms, x)) :: acc
adamc@90 163 | _ => Unknown cAll :: acc
adamc@90 164 in
adamc@90 165 (acc, gs' @ gs)
adamc@90 166 end
adamc@90 167
adamc@90 168 fun decomposeRow (c, (acc, gs)) =
adamc@90 169 let
adamc@90 170 val (cAll as (c, _), gs') = hnormCon (env, denv) c
adamc@90 171 val gs = gs' @ gs
adamc@90 172 in
adamc@90 173 case c of
adamc@90 174 CRecord (_, xcs) => foldl (fn ((x, _), acc_gs) => decomposeName (x, acc_gs)) (acc, gs) xcs
adamc@90 175 | CConcat (c1, c2) => decomposeRow (c1, decomposeRow (c2, (acc, gs)))
adamc@90 176 | CRel n => (Piece (RowR n) :: acc, gs)
adamc@90 177 | CNamed n => (Piece (RowN n) :: acc, gs)
adamc@90 178 | CModProj (m1, ms, x) => (Piece (RowM (m1, ms, x)) :: acc, gs)
adamc@90 179 | _ => (Unknown cAll :: acc, gs)
adamc@90 180 end
adamc@90 181 in
adamc@90 182 decomposeRow (c, ([], []))
adamc@90 183 end
adamc@90 184
adamc@90 185 and assert env denv (c1, c2) =
adamc@90 186 let
adamc@90 187 val (ps1, gs1) = decomposeRow (env, denv) c1
adamc@90 188 val (ps2, gs2) = decomposeRow (env, denv) c2
adamc@90 189
adamc@90 190 val unUnknown = List.mapPartial (fn Unknown _ => NONE | Piece p => SOME p)
adamc@90 191 val ps1 = unUnknown ps1
adamc@90 192 val ps2 = unUnknown ps2
adamc@90 193
adamc@90 194 (*val () = print "APieces1:\n"
adamc@90 195 val () = app pp ps1
adamc@90 196 val () = print "APieces2:\n"
adamc@90 197 val () = app pp ps2*)
adamc@90 198
adamc@90 199 fun assertPiece ps (p, denv) =
adamc@90 200 let
adamc@90 201 val pset = Option.getOpt (PM.find (denv, p), PS.empty)
adamc@90 202 val ps = case p of
adamc@90 203 NameC _ => List.filter (fn NameC _ => false | _ => true) ps
adamc@90 204 | _ => ps
adamc@90 205 val pset = PS.addList (pset, ps)
adamc@90 206 in
adamc@90 207 PM.insert (denv, p, pset)
adamc@90 208 end
adamc@90 209
adamc@90 210 val denv = foldl (assertPiece ps2) denv ps1
adamc@90 211 in
adamc@90 212 (foldl (assertPiece ps1) denv ps2, gs1 @ gs2)
adamc@90 213 end
adamc@90 214
adamc@90 215 and prove env denv (c1, c2, loc) =
adamc@90 216 let
adamc@90 217 val (ps1, gs1) = decomposeRow (env, denv) c1
adamc@90 218 val (ps2, gs2) = decomposeRow (env, denv) c2
adamc@82 219
adamc@88 220 val hasUnknown = List.exists (fn Unknown _ => true | _ => false)
adamc@88 221 val unUnknown = List.mapPartial (fn Unknown _ => NONE | Piece p => SOME p)
adamc@82 222 in
adamc@82 223 if hasUnknown ps1 orelse hasUnknown ps2 then
adamc@90 224 [(loc, env, denv, c1, c2)]
adamc@82 225 else
adamc@88 226 let
adamc@88 227 val ps1 = unUnknown ps1
adamc@88 228 val ps2 = unUnknown ps2
adamc@88 229
adamc@88 230 in
adamc@88 231 (*print "Pieces1:\n";
adamc@88 232 app pp ps1;
adamc@88 233 print "Pieces2:\n";
adamc@88 234 app pp ps2;*)
adamc@88 235
adamc@88 236 foldl (fn (p1, rem) =>
adamc@88 237 foldl (fn (p2, rem) =>
adamc@88 238 if prove1 denv (p1, p2) then
adamc@88 239 rem
adamc@88 240 else
adamc@90 241 (loc, env, denv, pieceToRow (p1, loc), pieceToRow (p2, loc)) :: rem) rem ps2)
adamc@90 242 (gs1 @ gs2) ps1
adamc@88 243 end
adamc@82 244 end
adamc@82 245
adamc@90 246 and hnormCon (env, denv) c =
adamc@90 247 let
adamc@90 248 val cAll as (c, loc) = ElabOps.hnormCon env c
adamc@90 249
adamc@90 250 fun doDisj (c1, c2, c) =
adamc@90 251 let
adamc@90 252 val (c, gs) = hnormCon (env, denv) c
adamc@90 253 in
adamc@90 254 (c, prove env denv (c1, c2, loc) @ gs)
adamc@90 255 end
adamc@90 256 in
adamc@90 257 case c of
adamc@90 258 CDisjoint cs => doDisj cs
adamc@90 259 | TDisjoint cs => doDisj cs
adamc@90 260 | _ => (cAll, [])
adamc@90 261 end
adamc@90 262
adamc@82 263 end