1 (* HCoop
Domtool (http
://hcoop
.sourceforge
.net
/)
2 * Copyright (c
) 2006, Adam Chlipala
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
.
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
.
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
.
19 (* Domtool
type-checking
and reduction environments
*)
21 structure Env
:> ENV
= struct
25 structure SS
= StringSet
26 structure SM
= StringMap
28 type typeRule
= exp
-> bool
29 val typeRules
: typeRule SM
.map ref
= ref SM
.empty
30 fun registerType (name
, rule
) = typeRules
:= SM
.insert (!typeRules
, name
, rule
)
31 fun typeRule name
= SM
.find (!typeRules
, name
)
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
)
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
)
44 val functions
: (exp list
-> exp option
) SM
.map ref
= ref SM
.empty
45 fun registerFunction (name
, f
) =
46 functions
:= SM
.insert (!functions
, name
, f
)
47 fun function name
= SM
.find (!functions
, name
)
50 val pr
= ref (fn () => ())
57 pr
:= (fn () => (old (); f ()))
64 val pst
= ref (fn () => ())
71 pst
:= (fn () => (old (); f ()))
78 val pr
= ref (fn () => ())
81 fun registerPreTycheck f
=
85 pr
:= (fn () => (old (); f ()))
87 fun preTycheck () = !pr ()
91 fun badArgs (name
, args
) =
92 (print ("Invalid arguments to " ^ name ^
"\n");
93 app (fn arg
=> Print
.preface ("Argument: ", Print
.p_exp arg
)) args
;
95 fun badArg (func
, arg
, v
) =
96 (print ("Invalid " ^ arg ^
" argument to " ^ func ^
"\n");
97 Print
.preface ("Argument: ", Print
.p_exp v
);
100 type 'a arg
= exp
-> 'a option
102 fun int (EInt n
, _
) = SOME n
105 fun string (EString s
, _
) = SOME s
108 fun bool (EVar
"false", _
) = SOME
false
109 |
bool (EVar
"true", _
) = SOME
true
112 fun mapFail f
[] = SOME
[]
113 | mapFail
f (h
:: t
) =
119 | SOME t
' => SOME (h
' :: t
')
121 fun list
f (EList ls
, _
) = mapFail f ls
124 fun none func
f (_
, []) = (f ();
126 | none func
_ (_
, es
) = badArgs (func
, es
)
128 fun one
func (name
, arg
) f (_
, [e
]) =
130 NONE
=> badArg (func
, name
, e
)
133 | one func _
_ (_
, es
) = badArgs (func
, es
)
135 fun two
func (name1
, arg1
, name2
, arg2
) f (_
, [e1
, e2
]) =
136 (case (arg1 e1
, arg2 e2
) of
137 (NONE
, _
) => badArg (func
, name1
, e1
)
138 |
(_
, NONE
) => badArg (func
, name2
, e2
)
139 |
(SOME v1
, SOME v2
) => (f (v1
, v2
);
141 | two func _
_ (_
, es
) = badArgs (func
, es
)
143 fun three
func (name1
, arg1
, name2
, arg2
, name3
, arg3
) f (_
, [e1
, e2
, e3
]) =
144 (case (arg1 e1
, arg2 e2
, arg3 e3
) of
145 (NONE
, _
, _
) => badArg (func
, name1
, e1
)
146 |
(_
, NONE
, _
) => badArg (func
, name2
, e2
)
147 |
(_
, _
, NONE
) => badArg (func
, name3
, e3
)
148 |
(SOME v1
, SOME v2
, SOME v3
) => (f (v1
, v2
, v3
);
150 | three func _
_ (_
, es
) = badArgs (func
, es
)
152 fun oneV
func (name
, arg
) f (evs
, [e
]) =
154 NONE
=> badArg (func
, name
, e
)
155 | SOME v
=> (f (evs
, v
);
157 | oneV func _
_ (_
, es
) = badArgs (func
, es
)
159 fun twoV
func (name1
, arg1
, name2
, arg2
) f (evs
, [e1
, e2
]) =
160 (case (arg1 e1
, arg2 e2
) of
161 (NONE
, _
) => badArg (func
, name1
, e1
)
162 |
(_
, NONE
) => badArg (func
, name2
, e2
)
163 |
(SOME v1
, SOME v2
) => (f (evs
, v1
, v2
);
165 | twoV func _
_ (_
, es
) = badArgs (func
, es
)
168 fun env
arg (evs
, name
) =
169 case SM
.find (evs
, name
) of
170 NONE
=> raise Fail ("Unavailable environment variable " ^ name
)
173 NONE
=> (Print
.preface ("Unexpected value for " ^ name ^
":",
175 raise Fail ("Bad format for environment variable " ^ name
))
178 fun type_one func arg f
=
179 registerType (func
, fn e
=>
184 fun action_none name f
= registerAction (name
, none name f
)
185 fun action_one name args f
= registerAction (name
, one name args f
)
186 fun action_two name args f
= registerAction (name
, two name args f
)
187 fun action_three name args f
= registerAction (name
, three name args f
)
189 fun actionV_none name f
= registerAction (name
, fn (env
, _
) => (f env
; env
))
190 fun actionV_one name args f
= registerAction (name
, oneV name args f
)
191 fun actionV_two name args f
= registerAction (name
, twoV name args f
)
193 fun container_none
name (f
, g
) = registerContainer (name
, none name f
, g
)
194 fun container_one name
args (f
, g
) = registerContainer (name
, one name args f
, g
)
196 fun containerV_one name
args (f
, g
) = registerContainer (name
, oneV name args f
, g
)
198 type env
= SS
.set
* (typ
* exp option
) SM
.map
* SS
.set
199 val empty
: env
= (SS
.empty
, SM
.empty
, SS
.empty
)
201 fun lookupType (ts
, _
, _
) name
= SS
.member (ts
, name
)
202 fun lookupVal (_
, vs
, _
) name
=
203 case SM
.find (vs
, name
) of
205 |
SOME (t
, _
) => SOME t
206 fun lookupEquation (_
, vs
, _
) name
=
207 case SM
.find (vs
, name
) of
209 |
SOME (_
, eqo
) => eqo
210 fun lookupContext (_
, _
, cs
) name
= SS
.member (cs
, name
)
212 fun bindType (ts
, vs
, cs
) name
= (SS
.add (ts
, name
), vs
, cs
)
213 fun bindVal (ts
, vs
, cs
) (name
, t
, eqo
) = (ts
, SM
.insert (vs
, name
, (t
, eqo
)), cs
)
214 fun bindContext (ts
, vs
, cs
) name
= (ts
, vs
, SS
.add (cs
, name
))
216 fun types (ts
, _
, _
) = ts
217 fun vals (_
, vs
, _
) = SM
.foldli (fn (name
, _
, vs
) => SS
.add (vs
, name
)) SS
.empty vs
218 fun contexts (_
, _
, cs
) = cs