{"created":"2023-05-15T11:55:40.402736+00:00","id":685,"links":{},"metadata":{"_buckets":{"deposit":"4c79702e-2dab-427b-9d5e-e102cb7436b4"},"_deposit":{"created_by":14,"id":"685","owners":[14],"pid":{"revision_id":0,"type":"depid","value":"685"},"status":"published"},"_oai":{"id":"oai:kyutech.repo.nii.ac.jp:00000685","sets":["12:19"]},"author_link":["3156"],"item_24_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1999-07-01","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{"bibliographic_title":"Technical Report in Computer Science and Systems Engineering","bibliographic_titleLang":"en"}]}]},"item_24_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_24_publisher_7":{"attribute_name":"出版社","attribute_value_mlt":[{"subitem_publisher":"九州工業大学","subitem_publisher_language":"ja"}]},"item_24_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1344-8803","subitem_source_identifier_type":"PISSN"}]},"item_24_text_58":{"attribute_name":"テクニカルレポートNo.","attribute_value_mlt":[{"subitem_text_value":"CSSE-5"}]},"item_24_version_type_59":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Fujita, Kenetsu","creatorNameLang":"en"},{"creatorName":"藤田, 憲悦","creatorNameLang":"ja"},{"creatorName":"フジタ, ケンエツ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2008-02-04"}],"displaytype":"detail","filename":"csse-5.pdf","filesize":[{"value":"189.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"csse-5.pdf","url":"https://kyutech.repo.nii.ac.jp/record/685/files/csse-5.pdf"},"version_id":"5c0f2dad-5d1d-42fa-901e-e2d1414798e2"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"technical report","resourceuri":"http://purl.org/coar/resource_type/c_18gh"}]},"item_title":"Type Inference for Domain-Free λ2","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Type Inference for Domain-Free λ2","subitem_title_language":"en"}]},"item_type_id":"24","owner":"14","path":["19"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2008-02-04"},"publish_date":"2008-02-04","publish_status":"0","recid":"685","relation_version_is_last":true,"title":["Type Inference for Domain-Free λ2"],"weko_creator_id":"14","weko_shared_id":-1},"updated":"2023-11-20T01:34:54.826434+00:00"}