Jason (jcreed) wrote,

More progress on implementation. Even with the concession that the user has to write like A ^ M for linear application, it's still not really possible to infer heavily higher-order types of simple eta-contracted arguments like as in

o : type.
c : ((o -o o) -o o) -> type.
d : c A.

which is really too bad. The type of the free variable A could be ((o -o o) -o o), but it could be other HLF things, too, or at least so says my current algorithm. Though I thought I had proved some kind of maximality theorem once...
Tags: work

  • (no subject)

    Didn't sleep well. Long day of work. Dinner with akiva at hanamichi.

  • (no subject)

    K was going to do a thing for her dad's birthday, but scheduling kept slipping and slipping so I guess we're going to try doing it tomorrow instead.

  • (no subject)

    Had a pleasant lunch with paul and gabe back from working-at-facebook times. Discussed the important issues of the day, by which I mean video games…

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

  • 1 comment