Jason (jcreed) wrote,
Jason
jcreed

The typechecker works pretty well now, minus actually solving unification problems; it prints out all residual equations that arise. I was able to encode the cut admissibility theorem and one case of it (the principal case for -o) and checked by hand that the 37 residual equations were satisfiable (most of them were pretty trivial). Rather encouraging!
Tags: work
Subscribe
  • Post a new comment

    Error

    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

  • 0 comments