Recursive programming with proofs (Q1190480): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automatic synthesis of typed \(\Lambda\)-programs on term algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3477935 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5619069 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3688389 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4268477 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive programming with proofs |
scientific article |
Statements
Recursive programming with proofs (English)
0 references
26 September 1992
0 references
We present some methods for programming with recursive data types using a fixed-point combinator, which allows one to construct programs having their intended behaviour.
0 references
recursive type theory
0 references
programming with recursive data types
0 references
fixed-point combinator
0 references
