Jason (jcreed) wrote,

Found "Toward Nominal Computation" by some folks out of Warsaw to be pretty interesting. Couldn't quite keep up with the examples in the talk, but the idea is that nominal set theory is also good for things that aren't binding-y or variable-y. There was some sort of automata that was described that turned out to be just the definition of finite automata transported from the category Set to the category of nominal sets.
Tags: popl

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