Linear types and non-size-increasing polynomial time computation
Author:
- M. HofmannMHM. Hofmann
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 464-473
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Stratified functional programs and computational complexity1993
- A new recursion-theoretic characterization of the polytime functionscomputational complexity, 1992