The Cut-Elimination Theorem for Differential Nets with Promotion [chapter]

Michele Pagani
2009 Lecture Notes in Computer Science  
Recently Ehrhard and Regnier have introduced Differential Linear Logic, DiLL for short -an extension of the Multiplicative Exponential fragment of Linear Logic that is able to express non-deterministic computations. The authors have examined the cut-elimination of the promotion-free fragment of DiLL by means of a proofnet-like calculus: differential interaction nets. We extend this analysis to exponential boxes and prove the Cut-Elimination Theorem for the whole DiLL: every differential net
more » ... is sequentializable can be reduced to a cut-free net.
doi:10.1007/978-3-642-02273-9_17 fatcat:5tep524tprgohnxvsh6jfktn2y