3 citations · 5 across the 3 of their papers we have counts for
1 paper · 1 filter
John Longley
We consider the sublanguages of Plotkin's PCF obtained by imposing some bound k on the levels of types for which fixed point operators are admitted. We show that these languages fo…