add6f172 |
1 | (* HCoop Domtool (http://hcoop.sourceforge.net/) |
2 | * Copyright (c) 2006, Adam Chlipala |
3 | * |
4 | * This program is free software; you can redistribute it and/or |
5 | * modify it under the terms of the GNU General Public License |
6 | * as published by the Free Software Foundation; either version 2 |
7 | * of the License, or (at your option) any later version. |
8 | * |
9 | * This program is distributed in the hope that it will be useful, |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
12 | * GNU General Public License for more details. |
13 | * |
14 | * You should have received a copy of the GNU General Public License |
15 | * along with this program; if not, write to the Free Software |
16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. |
ae3a5b8c |
17 | *) |
add6f172 |
18 | |
19 | (* Domtool type-checking and reduction environments *) |
20 | |
21 | structure Env :> ENV = struct |
22 | |
23 | open Ast |
24 | |
25 | structure SS = StringSet |
26 | structure SM = StringMap |
27 | |
a11c0ff3 |
28 | type typeRule = exp -> bool |
29 | val typeRules : typeRule SM.map ref = ref SM.empty |
4264c8ef |
30 | fun registerType (name, rule) = typeRules := SM.insert (!typeRules, name, rule) |
31 | fun typeRule name = SM.find (!typeRules, name) |
32 | |
a11c0ff3 |
33 | type env_vars = exp SM.map |
34 | type action = env_vars * Ast.exp list -> env_vars |
35 | val actions : action SM.map ref = ref SM.empty |
36 | fun registerAction (name, action) = actions := SM.insert (!actions, name, action) |
37 | fun action name = SM.find (!actions, name) |
38 | |
39 | val containers : (action * (unit -> unit)) SM.map ref = ref SM.empty |
40 | fun registerContainer (name, befor, after) = |
41 | containers := SM.insert (!containers, name, (befor, after)) |
42 | fun container name = SM.find (!containers, name) |
43 | |
2f68506c |
44 | fun badArgs (name, args) = |
45 | (print ("Invalid arguments to " ^ name ^ "\n"); |
46 | app (fn arg => Print.preface ("Argument: ", Print.p_exp arg)) args; |
47 | raise Domain) |
48 | fun badArg (func, arg, v) = |
49 | (print ("Invalid " ^ arg ^ " argument to " ^ func ^ "\n"); |
50 | Print.preface ("Argument: ", Print.p_exp v); |
51 | raise Domain) |
52 | |
53 | type 'a arg = exp -> 'a option |
54 | |
55 | fun int (EInt n, _) = SOME n |
56 | | int _ = NONE |
57 | |
58 | fun string (EString s, _) = SOME s |
59 | | string _ = NONE |
60 | |
61 | fun mapFail f [] = SOME [] |
62 | | mapFail f (h :: t) = |
63 | case f h of |
64 | NONE => NONE |
65 | | SOME h' => |
66 | case mapFail f t of |
67 | NONE => NONE |
68 | | SOME t' => SOME (h' :: t') |
69 | |
70 | fun list f (EList ls, _) = mapFail f ls |
71 | | list _ _ = NONE |
72 | |
cd873ae9 |
73 | fun none func f (_, []) = (f (); |
74 | SM.empty) |
75 | | none func _ (_, es) = badArgs (func, es) |
76 | |
2f68506c |
77 | fun one func (name, arg) f (_, [e]) = |
78 | (case arg e of |
79 | NONE => badArg (func, name, e) |
80 | | SOME v => (f v; |
81 | SM.empty)) |
82 | | one func _ _ (_, es) = badArgs (func, es) |
83 | |
84 | fun two func (name1, arg1, name2, arg2) f (_, [e1, e2]) = |
85 | (case (arg1 e1, arg2 e2) of |
86 | (NONE, _) => badArg (func, name1, e1) |
87 | | (_, NONE) => badArg (func, name2, e2) |
88 | | (SOME v1, SOME v2) => (f (v1, v2); |
89 | SM.empty)) |
90 | | two func _ _ (_, es) = badArgs (func, es) |
91 | |
92 | fun type_one func arg f = |
93 | registerType (func, fn e => |
94 | case arg e of |
95 | NONE => false |
96 | | SOME v => f v) |
97 | |
cd873ae9 |
98 | fun action_none name f = registerAction (name, none name f) |
2f68506c |
99 | fun action_one name args f = registerAction (name, one name args f) |
100 | fun action_two name args f = registerAction (name, two name args f) |
101 | |
102 | fun container_one name args (f, g) = registerContainer (name, one name args f, g) |
a11c0ff3 |
103 | |
51c32b45 |
104 | type env = SS.set * (typ * exp option) SM.map * SS.set |
105 | val empty : env = (SS.empty, SM.empty, SS.empty) |
add6f172 |
106 | |
51c32b45 |
107 | fun lookupType (ts, _, _) name = SS.member (ts, name) |
108 | fun lookupVal (_, vs, _) name = |
add6f172 |
109 | case SM.find (vs, name) of |
110 | NONE => NONE |
111 | | SOME (t, _) => SOME t |
51c32b45 |
112 | fun lookupEquation (_, vs, _) name = |
add6f172 |
113 | case SM.find (vs, name) of |
114 | NONE => NONE |
115 | | SOME (_, eqo) => eqo |
51c32b45 |
116 | fun lookupContext (_, _, cs) name = SS.member (cs, name) |
add6f172 |
117 | |
51c32b45 |
118 | fun bindType (ts, vs, cs) name = (SS.add (ts, name), vs, cs) |
119 | fun bindVal (ts, vs, cs) (name, t, eqo) = (ts, SM.insert (vs, name, (t, eqo)), cs) |
120 | fun bindContext (ts, vs, cs) name = (ts, vs, SS.add (cs, name)) |
121 | |
122 | fun types (ts, _, _) = ts |
123 | fun vals (_, vs, _) = SM.foldli (fn (name, _, vs) => SS.add (vs, name)) SS.empty vs |
124 | fun contexts (_, _, cs) = cs |
add6f172 |
125 | |
126 | end |