Jason (jcreed) wrote,
Jason
jcreed

Had some interesting whiteboard conversations with neel and noam today. Still can't actually get the last bit of this bimonadic proof irrelevance encoding to go quite how I want it. It all works as long as I sprinkle enough monads around the rest of the syntax, but I can't figure out whether I can get rid of them.
Tags: work
Subscribe

  • (no subject)

    I think I got around the need for corecursion by just using One More Linear Token: defining ◇A = ∃x.z(x) ⊗ □!(z(x) ⊸ ∀a.q(a) ⊸ ∃b.q(b) ⊗ □!(ℓ(a) ⊸…

  • (no subject)

    Thought some more about what happens when you take positive props P ::= ↓G | P ⊕ P | 0 negative props N ::= ↑G | N & N | ⊤ games G ::= {N|P}…

  • (no subject)

    Dang. Stuff from yesterday led down a path that made me think I had a very tidy answer to the age-old question of "read-only…

  • 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