A typed imperative language whose programs are exactly the polynomial-time computable functions.
By the definitions ofJ·K and{|·|}, the followings are valid: –JcK∈B and{|c|}= bool∈Bool whenever c∈{true, false}; –JcK∈Z and{|c|}= iint∈Int whenever c∈D+
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Programming Language for Feasible Solutions
A typed imperative language whose programs are exactly the polynomial-time computable functions.