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)

    Played some board games at the fb office with newly-arrived-to-nyc dan blandford and some friends-of-friends of his. Codenames and…

  • (no subject)

    This morning I suddenly had a memory of a game I used to play in the mid-late 90s over email. In it you "designed" animals by giving them, like, 4…

  • (no subject)

    Played some more Shenzhen I/O. The later puzzles are getting straight up hard. Had some fun optimizing the earlier ones, though.

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded