A universality theorem for PCF with recursive types, parallel-or and ∃ (Q4286532): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:38, 6 February 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
