Home

Examples

Roadmap

Ongoing work

• Coq/Yalla export
• LaTeX export (and induced image export through pdf)
• user call to an automated prover
• add cut rule (issue #12)
• explicit exchange rule (with colored backgrounds to follow instances of formulas) (issue #11)
• formula naming through (possibly recursive) equations (with click on name to unfold a definition inside a proof)

  𝔹 ::= (A ⊗ A) ⊸ (A ⊗ A)
  ℕ ::= !(A ⊸ A) ⊸ !(A ⊸ A)
  o ::= !o ⊸ o
  

Other directions

• two-sided sequent calculus
• intuitionistic linear logic
• quantifiers (issue #16)
• auto-reverse mode: automatically apply reversible rules
• automatic detection of non-provable sequents (by call to sufficient conditions and to an automated prover)
• contexts as first-class objects (issue #13)
• cyclic linear logic (exchange restricted to circular shifts, requires to modify the definition of dual of a formula)
• additional tool for proof transformations (cut elimination, axiom expansion, reversing, focusing, substitution, etc.) (issue #12)
• back edges for regular proofs
• fixed-point connectives in formulas
• mix rules (note mix₂ can be faithfully simulated by adding ?(⊥⊗⊥) in the context, and similarly for mix₀ with ?1)
• export to proof-nets