adamc@16: (* Copyright (c) 2008, Adam Chlipala
adamc@16:  * All rights reserved.
adamc@16:  *
adamc@16:  * Redistribution and use in source and binary forms, with or without
adamc@16:  * modification, are permitted provided that the following conditions are met:
adamc@16:  *
adamc@16:  * - Redistributions of source code must retain the above copyright notice,
adamc@16:  *   this list of conditions and the following disclaimer.
adamc@16:  * - Redistributions in binary form must reproduce the above copyright notice,
adamc@16:  *   this list of conditions and the following disclaimer in the documentation
adamc@16:  *   and/or other materials provided with the distribution.
adamc@16:  * - The names of contributors may not be used to endorse or promote products
adamc@16:  *   derived from this software without specific prior written permission.
adamc@16:  *
adamc@16:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@16:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@16:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@16:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@16:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
adamc@16:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@16:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@16:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@16:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@16:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@16:  * POSSIBILITY OF SUCH DAMAGE.
adamc@16:  *)
adamc@16: 
adamc@16: structure CoreUtil :> CORE_UTIL = struct
adamc@16: 
adamc@16: open Core
adamc@16: 
adamc@16: structure S = Search
adamc@16: 
adamc@16: structure Kind = struct
adamc@16: 
adamc@16: fun mapfold f =
adamc@16:     let
adamc@16:         fun mfk k acc =
adamc@16:             S.bindP (mfk' k acc, f)
adamc@16: 
adamc@16:         and mfk' (kAll as (k, loc)) =
adamc@16:             case k of
adamc@16:                 KType => S.return2 kAll
adamc@16: 
adamc@16:               | KArrow (k1, k2) =>
adamc@16:                 S.bind2 (mfk k1,
adamc@16:                       fn k1' =>
adamc@16:                          S.map2 (mfk k2,
adamc@16:                               fn k2' =>
adamc@16:                                  (KArrow (k1', k2'), loc)))
adamc@16: 
adamc@16:               | KName => S.return2 kAll
adamc@16: 
adamc@16:               | KRecord k =>
adamc@16:                 S.map2 (mfk k,
adamc@16:                         fn k' =>
adamc@16:                            (KRecord k', loc))
adamc@16:     in
adamc@16:         mfk
adamc@16:     end
adamc@16: 
adamc@16: fun map f k =
adamc@16:     case mapfold (fn k => fn () => S.Continue (f k, ())) k () of
adamc@16:         S.Return () => raise Fail "Core_util.Kind.map"
adamc@16:       | S.Continue (k, ()) => k
adamc@16: 
adamc@16: fun exists f k =
adamc@16:     case mapfold (fn k => fn () =>
adamc@16:                              if f k then
adamc@16:                                  S.Return ()
adamc@16:                              else
adamc@16:                                  S.Continue (k, ())) k () of
adamc@16:         S.Return _ => true
adamc@16:       | S.Continue _ => false
adamc@16: 
adamc@16: end
adamc@16: 
adamc@16: structure Con = struct
adamc@16: 
adamc@16: datatype binder =
adamc@16:          Rel of string * kind
adamc@16:        | Named of string * kind
adamc@16: 
adamc@16: fun mapfoldB {kind = fk, con = fc, bind} =
adamc@16:     let
adamc@16:         val mfk = Kind.mapfold fk
adamc@16: 
adamc@16:         fun mfc ctx c acc =
adamc@16:             S.bindP (mfc' ctx c acc, fc ctx)
adamc@16: 
adamc@16:         and mfc' ctx (cAll as (c, loc)) =
adamc@16:             case c of
adamc@16:                 TFun (c1, c2) =>
adamc@16:                 S.bind2 (mfc ctx c1,
adamc@16:                       fn c1' =>
adamc@16:                          S.map2 (mfc ctx c2,
adamc@16:                               fn c2' =>
adamc@16:                                  (TFun (c1', c2'), loc)))
adamc@16:               | TCFun (x, k, c) =>
adamc@16:                 S.bind2 (mfk k,
adamc@16:                       fn k' =>
adamc@16:                          S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@16:                               fn c' =>
adamc@16:                                  (TCFun (x, k', c'), loc)))
adamc@16:               | TRecord c =>
adamc@16:                 S.map2 (mfc ctx c,
adamc@16:                         fn c' =>
adamc@16:                            (TRecord c', loc))
adamc@16: 
adamc@16:               | CRel _ => S.return2 cAll
adamc@16:               | CNamed _ => S.return2 cAll
adamc@16:               | CApp (c1, c2) =>
adamc@16:                 S.bind2 (mfc ctx c1,
adamc@16:                       fn c1' =>
adamc@16:                          S.map2 (mfc ctx c2,
adamc@16:                               fn c2' =>
adamc@16:                                  (CApp (c1', c2'), loc)))
adamc@16:               | CAbs (x, k, c) =>
adamc@16:                 S.bind2 (mfk k,
adamc@16:                       fn k' =>
adamc@16:                          S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@16:                               fn c' =>
adamc@16:                                  (CAbs (x, k', c'), loc)))
adamc@16: 
adamc@16:               | CName _ => S.return2 cAll
adamc@16: 
adamc@16:               | CRecord (k, xcs) =>
adamc@16:                 S.bind2 (mfk k,
adamc@16:                       fn k' =>
adamc@16:                          S.map2 (ListUtil.mapfold (fn (x, c) =>
adamc@16:                                                       S.bind2 (mfc ctx x,
adamc@16:                                                             fn x' =>
adamc@16:                                                                S.map2 (mfc ctx c,
adamc@16:                                                                     fn c' =>
adamc@16:                                                                        (x', c'))))
adamc@16:                                  xcs,
adamc@16:                               fn xcs' =>
adamc@16:                                  (CRecord (k', xcs'), loc)))
adamc@16:               | CConcat (c1, c2) =>
adamc@16:                 S.bind2 (mfc ctx c1,
adamc@16:                       fn c1' =>
adamc@16:                          S.map2 (mfc ctx c2,
adamc@16:                               fn c2' =>
adamc@16:                                  (CConcat (c1', c2'), loc)))
adamc@16:     in
adamc@16:         mfc
adamc@16:     end
adamc@16: 
adamc@16: fun mapfold {kind = fk, con = fc} =
adamc@16:     mapfoldB {kind = fk,
adamc@16:               con = fn () => fc,
adamc@16:               bind = fn ((), _) => ()} ()
adamc@16: 
adamc@16: fun map {kind, con} c =
adamc@16:     case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16:                   con = fn c => fn () => S.Continue (con c, ())} c () of
adamc@16:         S.Return () => raise Fail "Core_util.Con.map"
adamc@16:       | S.Continue (c, ()) => c
adamc@16: 
adamc@16: fun mapB {kind, con, bind} ctx c =
adamc@16:     case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16:                    con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@16:                    bind = bind} ctx c () of
adamc@16:         S.Continue (c, ()) => c
adamc@16:       | S.Return _ => raise Fail "Con.mapB: Impossible"
adamc@16: 
adamc@16: fun exists {kind, con} k =
adamc@16:     case mapfold {kind = fn k => fn () =>
adamc@16:                                     if kind k then
adamc@16:                                         S.Return ()
adamc@16:                                     else
adamc@16:                                         S.Continue (k, ()),
adamc@16:                   con = fn c => fn () =>
adamc@16:                                     if con c then
adamc@16:                                         S.Return ()
adamc@16:                                     else
adamc@16:                                         S.Continue (c, ())} k () of
adamc@16:         S.Return _ => true
adamc@16:       | S.Continue _ => false
adamc@16: 
adamc@16: end
adamc@16: 
adamc@16: structure Exp = struct
adamc@16: 
adamc@16: datatype binder =
adamc@16:          RelC of string * kind
adamc@16:        | NamedC of string * kind
adamc@16:        | RelE of string * con
adamc@16:        | NamedE of string * con
adamc@16: 
adamc@16: fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
adamc@16:     let
adamc@16:         val mfk = Kind.mapfold fk
adamc@16: 
adamc@16:         fun bind' (ctx, b) =
adamc@16:             let
adamc@16:                 val b' = case b of
adamc@16:                              Con.Rel x => RelC x
adamc@16:                            | Con.Named x => NamedC x
adamc@16:             in
adamc@16:                 bind (ctx, b')
adamc@16:             end
adamc@16:         val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@16: 
adamc@16:         fun mfe ctx e acc =
adamc@16:             S.bindP (mfe' ctx e acc, fe ctx)
adamc@16: 
adamc@16:         and mfe' ctx (eAll as (e, loc)) =
adamc@16:             case e of
adamc@16:                 EPrim _ => S.return2 eAll
adamc@16:               | ERel _ => S.return2 eAll
adamc@16:               | ENamed _ => S.return2 eAll
adamc@16:               | EApp (e1, e2) =>
adamc@16:                 S.bind2 (mfe ctx e1,
adamc@16:                       fn e1' =>
adamc@16:                          S.map2 (mfe ctx e2,
adamc@16:                               fn e2' =>
adamc@16:                                  (EApp (e1', e2'), loc)))
adamc@16:               | EAbs (x, t, e) =>
adamc@16:                 S.bind2 (mfc ctx t,
adamc@16:                       fn t' =>
adamc@16:                          S.map2 (mfe (bind (ctx, RelE (x, t))) e,
adamc@16:                               fn e' =>
adamc@16:                                  (EAbs (x, t', e'), loc)))
adamc@16: 
adamc@16:               | ECApp (e, c) =>
adamc@16:                 S.bind2 (mfe ctx e,
adamc@16:                       fn e' =>
adamc@16:                          S.map2 (mfc ctx c,
adamc@16:                               fn c' =>
adamc@16:                                  (ECApp (e', c'), loc)))
adamc@16:               | ECAbs (x, k, e) =>
adamc@16:                 S.bind2 (mfk k,
adamc@16:                       fn k' =>
adamc@16:                          S.map2 (mfe (bind (ctx, RelC (x, k))) e,
adamc@16:                               fn e' =>
adamc@16:                                  (ECAbs (x, k', e'), loc)))
adamc@16: 
adamc@16:               | ERecord xes =>
adamc@16:                 S.map2 (ListUtil.mapfold (fn (x, e) =>
adamc@16:                                              S.bind2 (mfc ctx x,
adamc@16:                                                    fn x' =>
adamc@16:                                                       S.map2 (mfe ctx e,
adamc@16:                                                            fn e' =>
adamc@16:                                                               (x', e'))))
adamc@16:                                          xes,
adamc@16:                      fn xes' =>
adamc@16:                         (ERecord xes', loc))
adamc@16:               | EField (e, c, {field, rest}) =>
adamc@16:                 S.bind2 (mfe ctx e,
adamc@16:                       fn e' =>
adamc@16:                          S.bind2 (mfc ctx c,
adamc@16:                               fn c' =>
adamc@16:                                  S.bind2 (mfc ctx field,
adamc@16:                                           fn field' =>
adamc@16:                                              S.map2 (mfc ctx rest,
adamc@16:                                                   fn rest' =>
adamc@16:                                                      (EField (e', c', {field = field', rest = rest'}), loc)))))
adamc@16:     in
adamc@16:         mfe
adamc@16:     end
adamc@16: 
adamc@16: fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@16:     mapfoldB {kind = fk,
adamc@16:               con = fn () => fc,
adamc@16:               exp = fn () => fe,
adamc@16:               bind = fn ((), _) => ()} ()
adamc@16: 
adamc@16: fun map {kind, con, exp} e =
adamc@16:     case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16:                   con = fn c => fn () => S.Continue (con c, ()),
adamc@16:                   exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@16:         S.Return () => raise Fail "Core_util.Exp.map"
adamc@16:       | S.Continue (e, ()) => e
adamc@16: 
adamc@16: fun exists {kind, con, exp} k =
adamc@16:     case mapfold {kind = fn k => fn () =>
adamc@16:                                     if kind k then
adamc@16:                                         S.Return ()
adamc@16:                                     else
adamc@16:                                         S.Continue (k, ()),
adamc@16:                   con = fn c => fn () =>
adamc@16:                                     if con c then
adamc@16:                                         S.Return ()
adamc@16:                                     else
adamc@16:                                         S.Continue (c, ()),
adamc@16:                   exp = fn e => fn () =>
adamc@16:                                     if exp e then
adamc@16:                                         S.Return ()
adamc@16:                                     else
adamc@16:                                         S.Continue (e, ())} k () of
adamc@16:         S.Return _ => true
adamc@16:       | S.Continue _ => false
adamc@16: 
adamc@16: end
adamc@16: 
adamc@16: end