The recursion hierarchy for PCF is strict
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 form a strict hierarchy, in the sense that a fixed point operator for a type of level k can never be defined (up to o...
| 出版年: | Logical Methods in Computer Science |
|---|---|
| 第一著者: | |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
Logical Methods in Computer Science e.V.
2018-08-01
|
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/1543/pdf |