unification-pfa/test/test_projet_pfa_23_24.ml

open TypeInference

let tests_typeof =
  let x = Identifier.fresh () in
  let y = Identifier.fresh () in
  [ (* IntConst *)
    "0", Term.IntConst 0, Some Type.Int
  ; (* int -> int -> int = <fun> *)
    ( "fun x -> fun y -> x + y"
    , Term.(Fun (x, Fun (y, Binop (Var x, Plus, Var y))))
    , Some Type.(Arrow (Int, Arrow (Int, Int))) )
  ; (* Not typed variable *)
    "x", Term.(Var "x"), Some (Type.Var "x")
  ; (* Binary operation *)
    "1 + 2", Term.(Binop (IntConst 1, Plus, IntConst 2)), Some Type.Int
  ; (* Pair *)
    "(1, 2)", Term.(Pair (IntConst 1, IntConst 2)), Some Type.(Product (Int, Int))
  ; (* Projection with first *)
    "fst (1, 2)", Term.(Proj (First, Pair (IntConst 1, IntConst 2))), Some Type.Int
  ; (* Projection with second *)
    "snd (1, 2)", Term.(Proj (Second, Pair (IntConst 1, IntConst 2))), Some Type.Int
  ; (* Apply (int) into (fun : int -> int) *)
    ( "(fun x -> x + 1) 5"
    , Term.(App (Fun (x, Binop (Var x, Plus, IntConst 1)), IntConst 5))
    , Some Type.Int )
  ; (* Apply product (int * int) into a not compatible function (fun : int -> int) *)
    ( "(fun x -> x + 1) (1, 2)"
    , Term.(App (Fun (x, Binop (Var x, Plus, IntConst 1)), Pair (IntConst 1, IntConst 2)))
    , None )
  ]
;;

let typeModule = (module Type : Alcotest.TESTABLE with type t = Type.t)

let check_typeof term_text term expected_type =
  let open Alcotest in
  test_case term_text `Quick (fun () ->
    check (option typeModule) "Same type" expected_type (Inference.typeof term))
;;

let () =
  let open Alcotest in
  run
    "Inference"
    [ ( "typeof"
      , List.map
          (fun (term_text, term, expected_type) ->
            check_typeof term_text term expected_type)
          tests_typeof )
    ]
;;