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 fun badArgs (name
, args
) =
45 (print ("Invalid arguments to " ^ name ^
"\n");
46 app (fn arg
=> Print
.preface ("Argument: ", Print
.p_exp arg
)) args
;
48 fun badArg (func
, arg
, v
) =
49 (print ("Invalid " ^ arg ^
" argument to " ^ func ^
"\n");
50 Print
.preface ("Argument: ", Print
.p_exp v
);
53 type 'a arg
= exp
-> 'a option
55 fun int (EInt n
, _
) = SOME n
58 fun string (EString s
, _
) = SOME s
61 fun mapFail f
[] = SOME
[]
62 | mapFail
f (h
:: t
) =
68 | SOME t
' => SOME (h
' :: t
')
70 fun list
f (EList ls
, _
) = mapFail f ls
73 fun one
func (name
, arg
) f (_
, [e
]) =
75 NONE
=> badArg (func
, name
, e
)
78 | one func _
_ (_
, es
) = badArgs (func
, es
)
80 fun two
func (name1
, arg1
, name2
, arg2
) f (_
, [e1
, e2
]) =
81 (case (arg1 e1
, arg2 e2
) of
82 (NONE
, _
) => badArg (func
, name1
, e1
)
83 |
(_
, NONE
) => badArg (func
, name2
, e2
)
84 |
(SOME v1
, SOME v2
) => (f (v1
, v2
);
86 | two func _
_ (_
, es
) = badArgs (func
, es
)
88 fun type_one func arg f
=
89 registerType (func
, fn e
=>
94 fun action_one name args f
= registerAction (name
, one name args f
)
95 fun action_two name args f
= registerAction (name
, two name args f
)
97 fun container_one name
args (f
, g
) = registerContainer (name
, one name args f
, g
)
99 type env
= SS
.set
* (typ
* exp option
) SM
.map
* SS
.set
100 val empty
: env
= (SS
.empty
, SM
.empty
, SS
.empty
)
102 fun lookupType (ts
, _
, _
) name
= SS
.member (ts
, name
)
103 fun lookupVal (_
, vs
, _
) name
=
104 case SM
.find (vs
, name
) of
106 |
SOME (t
, _
) => SOME t
107 fun lookupEquation (_
, vs
, _
) name
=
108 case SM
.find (vs
, name
) of
110 |
SOME (_
, eqo
) => eqo
111 fun lookupContext (_
, _
, cs
) name
= SS
.member (cs
, name
)
113 fun bindType (ts
, vs
, cs
) name
= (SS
.add (ts
, name
), vs
, cs
)
114 fun bindVal (ts
, vs
, cs
) (name
, t
, eqo
) = (ts
, SM
.insert (vs
, name
, (t
, eqo
)), cs
)
115 fun bindContext (ts
, vs
, cs
) name
= (ts
, vs
, SS
.add (cs
, name
))
117 fun types (ts
, _
, _
) = ts
118 fun vals (_
, vs
, _
) = SM
.foldli (fn (name
, _
, vs
) => SS
.add (vs
, name
)) SS
.empty vs
119 fun contexts (_
, _
, cs
) = cs