论文信息 - Multi-focused cut elimination - 字舞流文

Multi-focused cut elimination

Nicolas Guenot | Taus Brock-Nannestad

[1] David Baelde,et al. Least and Greatest Fixed Points in Linear Logic , 2007, TOCL.

[2] Olivier Laurent. Polarized Proof-Nets and Lambda µ-Calculus , 1999 .

[3] Frank Pfenning,et al. A Logical Characterization of Forward and Backward Chaining in the Inverse Method , 2007, Journal of Automated Reasoning.

[4] Dale Miller,et al. A Framework for Proof Systems , 2010, Journal of Automated Reasoning.

[5] Dale Miller,et al. From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic , 2007, CSL.

[6] Kaustuv Chaudhuri. Focusing Strategies in the Sequent Calculus of Synthetic Connectives , 2008, LPAR.

[7] Nicolas Guenot,et al. Computation in focused intuitionistic logic , 2015, PPDP.

[8] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..

[9] JEAN-MARC ANDREOLI,et al. Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[10] Andrea Masini,et al. Proof nets, garbage, and computations , 1997, Theor. Comput. Sci..

[11] Chuck Liang,et al. Focusing and polarization in linear, intuitionistic, and classical logics , 2009, Theor. Comput. Sci..

[12] Nicolas Guenot,et al. Focused Linear Logic and the λ-calculus , 2015, MFPS.

[13] Carsten Schürmann,et al. Focused Natural Deduction , 2010, LPAR.

[14] G. Gentzen. Untersuchungen über das logische Schließen. I , 1935 .

[15] Nicolas Guenot,et al. Cut Elimination in Multifocused Linear Logic , 2014, LINEARITY.