Multiplicative linear logic proofs are isomorphic to programs in λ_𝜋, an extension of lambda calculus with parallelism, satisfying subject reduction, progress, strong normalization and confluence.
On natural dedu ction in classical first-order logic: Curry–howard correspondence, strong normalization and he rbrand’s theorem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs
Multiplicative linear logic proofs are isomorphic to programs in λ_𝜋, an extension of lambda calculus with parallelism, satisfying subject reduction, progress, strong normalization and confluence.