Name
Abstract | ||
|---|---|---|
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation of focused proofs, a complete subclass of linear sequent proofs known to have a much stronger structure than the standard sequent calculus for linear logic. Despite the classical setting, the interpretation relates proofs to a refined linear λ-calculus, and we investigate its properties and relation to other calculi, such as the usual λ-calculus, the λμ-calculus, and their variants based on sequent calculi. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.entcs.2015.12.008 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
Linear Logic,Focusing,Lambda-calculus,Curry-Howard Correspondence | Discrete mathematics,Natural deduction,Proof calculus,Substructural logic,Noncommutative logic,Sequent,Linear logic,Cut-elimination theorem,Mathematics,Calculus,Curry–Howard correspondence | Journal |
Volume | ISSN | Citations |
319 | 1571-0661 | 0 |
PageRank | References | Authors |
0.34 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taus Brock-Nannestad | 1 | 15 | 4.10 |
| Nicolas Guenot | 2 | 1 | 1.71 |