WEKO3
アイテム
Type Inference for Domain-Free λ2
http://hdl.handle.net/10228/933
http://hdl.handle.net/10228/93320ed559e-da60-48b0-8cc8-4d4f1bd4d605
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
csse-5.pdf (189.2 kB)
|
|
| Item type | テクニカルレポート = Technical Report(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2008-02-04 | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||||||||
| 資源タイプ | technical report | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | Type Inference for Domain-Free λ2 | |||||||||||||
| 言語 | en | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| 著者 |
藤田, 憲悦
× 藤田, 憲悦
|
|||||||||||||
| 抄録 | ||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||
| 内容記述 | We will prove that type checking, typability, and type inference fordomain-free 2 are undecidable. The type checking problem for domain-free 2 was posed by Barthe and S rensen (1997). A certain second or-der uni cation problem is reduced to the problem of type inference fordomain-free 2. The restricted second order uni cation has been provenundecidable by Schubert. The reduction method can be obtained from asimpli cation of Pfenning's reduction from the general problem of secondorder uni cation to the partial type inference problem. An analysis of theundecidability proof reveals that the typability problem is still undecid-able even for a predicative fragment of domain-free 2, called the rank 2fragment. | |||||||||||||
| 言語 | en | |||||||||||||
| 書誌情報 |
en : Technical Report in Computer Science and Systems Engineering 発行日 1999-07-01 |
|||||||||||||
| 出版社 | ||||||||||||||
| 出版者 | 九州工業大学 | |||||||||||||
| 言語 | ja | |||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||||
| 収録物識別子 | 1344-8803 | |||||||||||||
| 出版タイプ | ||||||||||||||
| 出版タイプ | VoR | |||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||||||
| テクニカルレポートNo. | ||||||||||||||
| CSSE-5 | ||||||||||||||
