Soft Linear Logic: A Language for Polynomial Time Computation: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:0115:01, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,857 bytes +1,857‎ Created page with "Title: Soft Linear Logic: A Language for Polynomial Time Computation Abstract: Soft linear logic (SLL) is a subsystem of linear logic that can characterize the PTIME complexity class. This study introduces soft lambda-calculus, a typable calculus in the intuitionistic and affine variant of SLL. The main result is that the untyped terms of this calculus can be reduced in polynomial time. The type system of SLL is extended with recursive types, allowing for non-standard t..."
Retrieved from "https://simplesci.org/wiki/Soft_Linear_Logic:_A_Language_for_Polynomial_Time_Computation"