On an interpretation of safe recursion in light affine logic (Q1827399): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076030590 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4936120 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Light linear logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear types and non-size-increasing polynomial time computation. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4499227 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4945245 / rank | |||
Normal rank | |||
Latest revision as of 19:20, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an interpretation of safe recursion in light affine logic |
scientific article |
Statements
On an interpretation of safe recursion in light affine logic (English)
0 references
6 August 2004
0 references
Computational complexity
0 references
Light affine logic
0 references
Polynomial-time computability
0 references
