Characterising Polytime through higher type Recursion - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Characterising Polytime through higher type Recursion

Abstract

It is shown how to restrict recursion on notation in all finite types so as to characterise the polynomial time computable functions. The restrictions are obtained by enriching the type structure with the formation of types $!\sigma$, and by adding linear concepts to the lambda calculus.
Fichier principal
Vignette du fichier
98-R-239.pdf (230.44 Ko) Télécharger le fichier

Dates and versions

inria-00098738 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098738 , version 1

Cite

Karl-Heinz Niggl. Characterising Polytime through higher type Recursion. [Intern report] 98-R-239 || niggl98a, 1998, 17 p. ⟨inria-00098738⟩
54 View
52 Download

Share

Gmail Facebook Twitter LinkedIn More