An arithmetic for polynomial-time computation (Q2500489): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093877547 / rank | |||
Normal rank | |||
Revision as of 21:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An arithmetic for polynomial-time computation |
scientific article |
Statements
An arithmetic for polynomial-time computation (English)
0 references
16 August 2006
0 references
Constructive proofs theoretically allow for the extraction of correct programs for specifications. This paper is concerned with the feasibility of such methodology. The author defines a restriction of Heyting arithmetic which has the property that all extracted codes are efficient. These restrictions concern the ranges of the terms and the like.
0 references
polynomial-time
0 references
linear Heyting arithmetic
0 references
ramification
0 references
