Dual Light Affine Logic (DLAL) 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:2815:28, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,637 bytes +1,637‎ Created page with "Title: Dual Light Affine Logic (DLAL) for Polynomial Time Computation Research Question: Can we develop a type system for lambda-calculus that ensures polynomial time computation while maintaining the benefits of linear and intuitionistic logic? Methodology: We propose Dual Light Affine Logic (DLAL), a new type system for lambda-calculus. DLAL combines linear and intuitionistic logic with a single modality, resulting in a simpler type language with the same propertie..."
Retrieved from "https://simplesci.org/wiki/Dual_Light_Affine_Logic_(DLAL)_for_Polynomial_Time_Computation"