equal
deleted
inserted
replaced
1 (* Title: Tools/code/code_funcgr.ML |
1 (* Title: Tools/code/code_funcgr.ML |
2 Author: Florian Haftmann, TU Muenchen |
2 Author: Florian Haftmann, TU Muenchen |
3 |
3 |
4 Retrieving, normalizing and structuring code equations in graph |
4 Retrieving, normalizing and structuring code equations in graph |
5 with explicit dependencies. |
5 with explicit dependencies. |
|
6 |
|
7 Legacy. To be replaced by Tools/code/code_wellsorted.ML |
6 *) |
8 *) |
7 |
9 |
8 signature CODE_FUNCGR = |
10 signature CODE_WELLSORTED = |
9 sig |
11 sig |
10 type T |
12 type T |
11 val eqns: T -> string -> (thm * bool) list |
13 val eqns: T -> string -> (thm * bool) list |
12 val typ: T -> string -> (string * sort) list * typ |
14 val typ: T -> string -> (string * sort) list * typ |
13 val all: T -> string list |
15 val all: T -> string list |
19 val eval_term: theory |
21 val eval_term: theory |
20 -> (term -> term * (((sort -> sort) * Sorts.algebra) -> T -> 'a)) -> term -> 'a |
22 -> (term -> term * (((sort -> sort) * Sorts.algebra) -> T -> 'a)) -> term -> 'a |
21 val timing: bool ref |
23 val timing: bool ref |
22 end |
24 end |
23 |
25 |
24 structure Code_Funcgr : CODE_FUNCGR = |
26 structure Code_Wellsorted : CODE_WELLSORTED = |
25 struct |
27 struct |
26 |
28 |
27 (** the graph type **) |
29 (** the graph type **) |
28 |
30 |
29 type T = (((string * sort) list * typ) * (thm * bool) list) Graph.T; |
31 type T = (((string * sort) list * typ) * (thm * bool) list) Graph.T; |