A self-contained mechanization of LFPL and LFPL+ with streamlined soundness and completeness proofs for polynomial-time functions, using novel proof techniques and a stack-like data structure.
24 Anton Lorenzen, Daan Leijen, and Wouter Swierstra
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
LFPL: Revisited and Mechanized
A self-contained mechanization of LFPL and LFPL+ with streamlined soundness and completeness proofs for polynomial-time functions, using novel proof techniques and a stack-like data structure.