The following references are available electronicly:
Klaus Aehlig and Helmut Schwichtenberg.
A syntactical analysis of non-size-increasing polynomial time computation
Steve Bellantoni and Martin Hofmann.
A New "Feasible" Arithmetic
Berger.
Program Extraction from Normalization Proofs
Martin Hofmann.
Linear types and non-size-increasing polynomial time computation
Helmut Schwichtenberg.
Feasible programms from proofs
$Date: 2010/10/08 10:23:26 $