A universality theorem for PCF with recursive types, parallel-or and ∃ (Q4286532): Difference between revisions
From MaRDI portal
Added link to MaRDI 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: LCF considered as a programming language / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Effectively given domains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expressibility of functionals in D. Scott's LCF language / rank | |||
Normal rank | |||
Latest revision as of 13:23, 22 May 2024
scientific article; zbMATH DE number 541154
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A universality theorem for PCF with recursive types, parallel-or and ∃ |
scientific article; zbMATH DE number 541154 |
Statements
A universality theorem for PCF with recursive types, parallel-or and ∃ (English)
0 references
11 December 1994
0 references
typed \(\lambda\)-calculus
0 references
universal programming language
0 references
PCF
0 references
minimal fixpoint operator
0 references
recursive types
0 references
