Jason (jcreed) wrote,
Jason
jcreed

Having a really pleasant, slow day. After getting lunch at Union Grill with norm and platypuslord, I just relaxedly hung around a very quiet Wean, chatted with random people I bumped into, talked algebra and field theory with Norm and game theory with Marty, thought a lot about representing linear and/or bunched cut elimination and so forth. Somehow I don't think my idea of a lazy Saturday has much in common with most people's, but it makes me happy.

Shoot me now, I'm getting interested in petri nets again. I keep smelling the possibility of a really short, clean proof of the decidaibility of net reachability lurking in all this bunched logic stuff. I love the title of this paper, though.
Subscribe

  • (no subject)

    Something that's bugged me for a long time is this: How many paths, starting at the origin, taking N steps either up, down, left or right, end up at…

  • (no subject)

    Still sad that SAC seems to end up being as complicated as it is. Surely there's some deeper duality between…

  • (no subject)

    I had already been meaning to dig into JaneSt's "Incremental" library, which bills itself as a practical implementation (in ocaml) of the ideas in…

  • 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