Home

Roadmap

• Coq/Yalla export
• LaTeX export
• call to an automated prover
• add cut rule (issue #12)
• cyclic linear logic (exchange restricted to circular shifts)
• explicit exchange rule (with colored backgrounds to follow instances of formulas) (issue #11)
• formula naming through (possibly recursive) equations Φ ::= (A ⊗ A) ⊸ (A ⊗ A) (with click on name to unfold in proofs)
• back edges for regular proofs
• mix rules

Examples

• A⊗B ⊢ B⊗A
• (A⊗B)⊗C ⊢ A⊗(B⊗C)
• A⊗(B⊸C) ⊢ B⊸(A⊗C)
• A⊗(B⊕C) ⊢ (A⊗B)⊕(A⊗C)
• !(A&B) ⊢ !A⊗!B
• !A⊗!B ⊢ !(A&B)
• A⊗(A⊸A) ⊢ A⊗!(A⊸A)
• ((A⊸R)⊸R)⊗((B⊸R)⊸R) ⊢ ((A⊗B)⊸R)⊸R
• ((A⊸R)⊸R)⊕((B⊸R)⊸R) ⊢ ((A⊕B)⊸R)⊸R
• ((A⊸?B)⊸A)⊸?A
• !(A⅋B)⊸(?!?A⅋?!?B)
• ((((0⊸1)⊸1)⊸0)⊸0)⊸1
• (((X⊗⊤)&(Y⊗⊤))⊸0)⊸((X⊸X')⊕(Y⊸Y'))