The notation|˜s|:=∑m i=1|sm|, i.e., the sum of the bit-size of all statement in˜s

for any storeΣsuch that⟨Σ,˜s⟩⇓Σ′for someΣ′, andt≥t0(|Σ|), one has that⟨Σ[y↦→t],˜s0⟩⇓Σ′[y↦→t]

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.PL · 2025-07-25 · unverdicted · novelty 5.0

A typed imperative language whose programs are exactly the polynomial-time computable functions.

Showing 1 of 1 citing paper.

A Programming Language for Feasible Solutions cs.PL · 2025-07-25 · unverdicted · none · ref 39
A typed imperative language whose programs are exactly the polynomial-time computable functions.