{"created":"2025-01-19T01:33:03.346355+00:00","updated":"2025-01-19T10:29:37.497170+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00232282","sets":["6164:6805:6807:11588"]},"path":["11588"],"owner":"44499","recid":"232282","title":["Agda による Automaton の記述"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-01-06"},"_buckets":{"deposit":"e838219e-ef6c-4870-9798-e1d362a991c7"},"_deposit":{"id":"232282","pid":{"type":"depid","value":"232282","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Agda による Automaton の記述","author_link":["628190","628189"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Agda による Automaton の記述"},{"subitem_title":"Automaon description in Agda","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Agda, Automaton","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-01-06","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"琉球大学工学部"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering, University of the Ryukyus","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/232282/files/IPSJ-WPRO2024008.pdf","label":"IPSJ-WPRO2024008.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-06"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-WPRO2024008.pdf","filesize":[{"value":"186.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5d88f473-09b0-4bb5-8c4e-79cdef0d38b6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"河野, 真治"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shinji, Kono","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Automaton\\cite{sipser96}はコンピュータの能力の限界や階層、計算量を理解するための重要な理論である。Automaton の理論に関する証明を Agda\\cite{Norell:2009:DTP:1481861.1481862} で行う\\cite{automaton-kono-github}。従来の教科書は一階述語論理と素朴集合論程度で書かれていて、数学的な構造や定理、証明が形式化されていることはほとんどない。Agda はプログラミング言語であると同時に定理証明系なので、Automaton の実装と、その性質の証明を同じ言語で行うことができる。Automaton の基本的な部分の証明を理解することがプログラムの信頼性を理解することにつながる。Agdaは古典的な一階述語論理と異なる証明により真理値が決まる直観主義論理であり、それを理解することは数学の証明が何かを理解することになる。特にAutomatonと非決定性Automatonの意味(language)としての同等性を簡単に示すことができる。Automatonの状態の有限性に関しても考察を行う。","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"49","bibliographic_titles":[{"bibliographic_title":"第65回プログラミング・シンポジウム予稿集"}],"bibliographicPageStart":"41","bibliographicIssueDates":{"bibliographicIssueDate":"2024-01-06","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":232282,"links":{}}