aboutsummaryrefslogtreecommitdiff
path: root/discocaml/eval.ml
blob: aa90d4184d3d4306bbd880cfb1ba4bd0fdd3e702 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
open Ast

exception FoundRedex of expr index

let check_redex (ast : expr ast) (i : expr index) : unit =
  match get_subexpr ast i with
  | App (f, _) -> (
      match get_subexpr ast f with
      | Lam (_, _) -> raise (FoundRedex i)
      | _ -> ())
  | Int _ -> ()
  | Lam (_, _) -> ()
  | Prim (Add, (l, r)) | Prim (Sub, (l, r)) | Prim (Mul, (l, r)) -> (
      match (get_subexpr ast l, get_subexpr ast r) with
      | Int _, Int _ -> raise (FoundRedex i)
      | _ -> ())
  | Var _ -> ()

let find_redex_cbv_in (ast : expr ast) : expr index -> unit =
  let rec loop (i : expr index) : unit =
    (match get_subexpr ast i with
    | App (f, x) ->
        loop f;
        loop x
    | Int _ -> ()
    | Lam (_, _) -> ()
    | Prim (Add, (l, r)) | Prim (Sub, (l, r)) | Prim (Mul, (l, r)) ->
        loop l;
        loop r
    | Var _ -> ());
    check_redex ast i
  in
  loop

let find_redex_cbn_in (ast : expr ast) : expr index -> unit =
  let rec loop (i : expr index) : unit =
    check_redex ast i;
    match get_subexpr ast i with
    | App (f, x) ->
        loop f;
        loop x
    | Int _ -> ()
    | Lam (_, _) -> ()
    | Prim (Add, (l, r)) | Prim (Sub, (l, r)) | Prim (Mul, (l, r)) ->
        loop l;
        loop r
    | Var _ -> ()
  in
  loop

let find_redex_cbv (ast : expr ast) : expr index option =
  try
    find_redex_cbv_in ast ast.root;
    None
  with FoundRedex i -> Some i

let find_redex_cbn (ast : expr ast) : expr index option =
  try
    find_redex_cbn_in ast ast.root;
    None
  with FoundRedex i -> Some i

exception NotARedex of expr ast

let reduce (ast : expr ast) (i : expr index) : expr ast =
  let fail () = raise (NotARedex { ast with root = i }) in
  let ast = copy ast in
  let must_int j = match get_subexpr ast j with Int n -> n | _ -> fail () in
  Arraylist.set ast.subexprs i.index
    (match get_subexpr ast i with
    | App (_f, _x) -> failwith "TODO"
    | Prim (Add, (l, r)) -> Int (must_int l + must_int r)
    | Prim (Sub, (l, r)) -> Int (must_int l - must_int r)
    | Prim (Mul, (l, r)) -> Int (must_int l * must_int r)
    | _ -> fail ());
  ast