com.cliffc.aa.HM.TestHM2 Class Reference

Public Member Functions
void	reset ()
void	test00 ()
void	test01 ()
void	test02 ()
void	test03 ()
void	test04 ()
void	test05 ()
void	test06 ()
void	test07 ()
void	test08 ()
void	test09 ()
void	test10 ()
void	test11 ()

Detailed Description

Definition at line 10 of file TestHM2.java.

Member Function Documentation

reset()

void com.cliffc.aa.HM.TestHM2.reset

(

)

Definition at line 12 of file TestHM2.java.

{ HM2.reset(); }

References com.cliffc.aa.HM.HM2.reset().

Here is the call graph for this function:

test00()

void com.cliffc.aa.HM.TestHM2.test00

(

)

Definition at line 15 of file TestHM2.java.

                       {
    Syntax syn = new Ident("fred");
    HM2.hm(syn);
  }

References com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test01()

void com.cliffc.aa.HM.TestHM2.test01

(

)

Definition at line 21 of file TestHM2.java.

                       {
    Syntax syn = new Con(TypeInt.con(3));
    HMVar t = (HMVar)HM2.hm(syn);
    assertEquals(TypeInt.con(3),t.type());
  }

References com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test02()

void com.cliffc.aa.HM.TestHM2.test02

(

)

Definition at line 28 of file TestHM2.java.

                       {
    Syntax syn = new Apply(new Ident("pair"),new Con(TypeInt.con(3)));
    HMType t = HM2.hm(syn);
    assertEquals("{ v9 -> pair(v8:3,v9) }",t.str());
  }

References com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test03()

void com.cliffc.aa.HM.TestHM2.test03

(

)

Definition at line 35 of file TestHM2.java.

                       {
    // let fact = {n -> (  if/else (==0 n)  1  ( * n  (fact (dec n))))} in fact;
    // let fact = {n -> (((if/else (==0 n)) 1) ((* n) (fact (dec n))))} in fact;
    Syntax fact =
      new Let("fact",
              new Lambda("n",
                         new Apply(new Apply( new Apply(new Ident("if/else"),
                                                        new Apply(new Ident("==0"),new Ident("n"))),
                                              new Con(TypeInt.con(1))),
                                   new Apply(new Apply(new Ident("*"), new Ident("n")),
                                             new Apply(new Ident("fact"),
                                                       new Apply(new Ident("dec"),new Ident("n")))))),
              new Ident("fact"));
    HMType t1 = HM2.hm(fact);
    assertEquals("{ v25:int64 -> v25:int64 }",t1.str());
  }

References com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test04()

void com.cliffc.aa.HM.TestHM2.test04

(

)

Definition at line 53 of file TestHM2.java.

                       {
    // { x -> (pair (x 3) (x "abc")) }
    Syntax x =
      new Lambda("x",
                 new Apply(new Apply(new Ident("pair"),
                                     new Apply(new Ident("x"), new Con(TypeInt.con(3)))),
                           new Apply(new Ident("x"), new Con(TypeStr.ABC))));
    HMType t1 = HM2.hm(x);
    assertEquals("{ { v11:all -> v9 } -> pair(v9,v9) }",t1.str());
  }

References com.cliffc.aa.type.TypeStr.ABC, com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test05()

void com.cliffc.aa.HM.TestHM2.test05

(

)

Definition at line 65 of file TestHM2.java.

                       {
    // ({ x -> (pair (x 3) (x "abc")) } {x->x})
    Syntax x =
      new Apply(new Lambda("x",
                           new Apply(new Apply(new Ident("pair"),
                                               new Apply(new Ident("x"), new Con(TypeInt.con(3)))),
                                     new Apply(new Ident("x"), new Con(TypeStr.ABC)))),
                new Lambda("y", new Ident("y")));
 
    HMType t1 = HM2.hm(x);
    assertEquals("pair(v9:all,v9:all)",t1.str());
  }

References com.cliffc.aa.type.TypeStr.ABC, com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test06()

void com.cliffc.aa.HM.TestHM2.test06

(

)

Definition at line 80 of file TestHM2.java.

                       {
    // recursive unification
    // fn f => f f (fail)
    Syntax x =
      new Lambda("f", new Apply(new Ident("f"), new Ident("f")));
    HM2.hm(x);
  }

References com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test07()

void com.cliffc.aa.HM.TestHM2.test07

(

)

Definition at line 89 of file TestHM2.java.

                       {
    // let g = fn f => 5 in g g
    Syntax x =
      new Let("g",
              new Lambda("f", new Con(TypeInt.con(5))),
              new Apply(new Ident("g"), new Ident("g")));
    HMType t1 = HM2.hm(x);
    assertEquals("v12:5",t1.str());
  }

References com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test08()

void com.cliffc.aa.HM.TestHM2.test08

(

)

Definition at line 100 of file TestHM2.java.

                       {
    // example that demonstrates generic and non-generic variables:
    // fn g => let f = fn x => g in pair (f 3, f true)
    Syntax syn =
      new Lambda("g",
                 new Let("f",
                         new Lambda("x", new Ident("g")),
                         new Apply(
                                   new Apply(new Ident("pair"),
                                             new Apply(new Ident("f"), new Con(TypeInt.con(3)))
                                             ),
                                   new Apply(new Ident("f"), new Con(TypeInt.con(1))))));
 
    HMType t1 = HM2.hm(syn);
    assertEquals("{ v11 -> pair(v11,v11) }",t1.str());
  }

References com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test09()

void com.cliffc.aa.HM.TestHM2.test09

(

)

Definition at line 118 of file TestHM2.java.

                       {
    // Function composition
    // fn f (fn g (fn arg (f g arg)))
    Syntax syn =
      new Lambda("f", new Lambda("g", new Lambda("arg", new Apply(new Ident("g"), new Apply(new Ident("f"), new Ident("arg"))))));
 
    HMType t1 = HM2.hm(syn);
    assertEquals("{ { v10 -> v11 } -> { { v11 -> v12 } -> { v10 -> v12 } } }",t1.str());
  }

References com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test10()

void com.cliffc.aa.HM.TestHM2.test10

(

)

Definition at line 130 of file TestHM2.java.

                       {
    // Looking at when tvars are duplicated ("fresh" copies made).
    // This is the "map" problem with a scalar instead of a collection.
    // Takes a '{a->b}' and a 'a' for a couple of different prims.
    // let map = { fun -> {x -> (fun x) }} in ((pair ((map str) 5)) ((map factor) 2.3))
    Syntax syn =
      new Let("map",
              new Lambda("fun",
                         new Lambda("x",
                                    new Apply(new Ident("fun"),new Ident("x")))),
              new Apply(new Apply(new Ident("pair"),
                                  new Apply(new Apply(new Ident("map"),
                                                      new Ident("str")), new Con(TypeInt.con(5)))),
                        new Apply(new Apply(new Ident("map"),
                                            // "factor" a float returns a pair (mod,rem).
                                            new Ident("factor")), new Con(TypeFlt.con(2.3)))));
    HMType t1 = HM2.hm(syn);
    assertEquals("pair(v12:*str,pair(v26:flt64,v26:flt64))",t1.str());
  }

References com.cliffc.aa.type.TypeFlt.con(), com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

test11()

void com.cliffc.aa.HM.TestHM2.test11

(

)

Definition at line 151 of file TestHM2.java.

                       {
    // Checking behavior when using "if/else" to merge two functions with
    // sufficiently different signatures, then attempting to pass them to a map
    // & calling internally.
    // fcn takes a predicate 'p' and returns one of two fcns.
    //   let fcn = { p -> (((if/else p) {a -> pair[a,a]}) {b -> pair[b,pair[3,b]]}) } in
    // map takes a function and an element (collection?) and applies it (applies to collection?)
    //   let map = { fun -> {x -> (fun x) }} in
    // Should return either { p -> p ? [5,5] : [5,[3,5]] }
    //   { q -> ((map (fcn q)) 5) }
    Syntax syn =
      new Let("fcn",
              new Lambda("p",
                         new Apply(new Apply(new Apply(new Ident("if/else"),new Ident("p")), // p ?
                                             new Lambda("a",
                                                        new Apply(new Apply(new Ident("pair"),new Ident("a")),
                                                                  new Ident("a")))),
                                   new Lambda("b",
                                              new Apply(new Apply(new Ident("pair"),new Ident("b")),
                                                        new Apply(new Apply(new Ident("pair"),new Con(TypeInt.con(3))),
                                                                  new Ident("b")))))),
              new Let("map",
                      new Lambda("fun",
                                 new Lambda("x",
                                            new Apply(new Ident("fun"),new Ident("x")))),
                      new Lambda("q",
                                 new Apply(new Apply(new Ident("map"),
                                                     new Apply(new Ident("fcn"),new Ident("q"))),
                                           new Con(TypeInt.con(5))))));
    // Ultimately, unifies "a" with "pair[3,a]" which throws recursive unification.
    HMType t1 = HM2.hm(syn);
    assertEquals("TBD",t1.str());
  }

References com.cliffc.aa.type.TypeInt.con(), and com.cliffc.aa.HM.HM2.hm().

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• TestHM2.java