Jason (jcreed) wrote,
Jason
jcreed

-

Worked out strictness, I think. Remains to be proven.
This ,\x -: A . c x = Y unification problem is really annoying.

Checked over a few cases of the completeness proof and they look good.
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