Jason (jcreed) wrote,

Meeting with Frank. Sketched the ideas I was working on in a bit more detail. Pointed out that MELL reduces to VCS with just one binary rule, and Frank responded that, well, higher-order unification becomes undecidable with just one binary predicate. So, yeah, lately I've been thinking that it might be undecidable. I should dig up papers on higher-order unification, undecidability of Petri Net equivalence, and decidability of affine logic.

Type systems happened. Bounded quantification is neat.

D&D: Wandered around in the cave some more. Had 8 people for JM; they had to split us up. Futzed with the OSC piano after that. Chord progression to remember: C Ab Eb G

  • (no subject)

    Guy from Seattle team we've been working with showed up today at work; no matter how much I'm generally comfortable working with remote teams (and I…

  • (no subject)

    Sean's back in town --- good fun working with nonremote teammates.

  • (no subject)

    Sean's in town at work, good times.

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded