Automatizing termination proofs of recursively defined functions (Q1346629): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)00021-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990295079 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3477935 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3108200 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive programming with proofs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:39, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automatizing termination proofs of recursively defined functions |
scientific article |
Statements
Automatizing termination proofs of recursively defined functions (English)
0 references
6 April 1995
0 references
ProPRe program synthesis system
0 references
