Jason (jcreed) wrote,

I had a notion this morning that there was a way of reducing that distance-types ICFP 2010 paper down to something more discrete and graphy, which might have some cute consequences for type systems for reactive programming. In a doodle, this is as far as I've thought through it:
Linear Logic & Directed Graphs
But the more I think about this the more I think I have something that smells like it might be a sound and complete interpretation of intuitionistic linear logic in the category of directed graphs, which sounds too simple to not already be known about, so I'm wondering what my mistake is. Is it just, like, the directed-graph (and consequently (?) intuitionistic?) equivalent of the undirected-graph coherence space model of classical linear logic? That would be neat, but I'm not holding my breath.
Tags: graphs, linear logic, logic, math

  • (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


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded