{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NNC5A2TIMGEWPV5CCHZQ7E5ZCF","short_pith_number":"pith:NNC5A2TI","schema_version":"1.0","canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","source":{"kind":"arxiv","id":"1004.2884","version":2},"attestation_state":"computed","paper":{"title":"HMC: Verifying Functional Programs Using Abstract Interpreters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andrey Rybalchenko, Ranjit Jhala, Rupak Majumdar","submitted_at":"2010-04-16T17:01:27Z","abstract_excerpt":"We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed higher-order functional programs. HMC works as follows. First, it uses the type structure of the functional program to generate a set of logical refinement constraints whose satisfaction implies the safety of the source program. Next, it transforms the logical refinement constraints into a simple first-order imperative program that is safe iff the constraints are satisfiable. Thus, in one swoop, HMC makes tools for in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1004.2884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-04-16T17:01:27Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4b53dac9cac767437de85ff880dd116281b12f84a4b88f1f0398e43e70114b85","abstract_canon_sha256":"2b5c01e334f32a189ea9443406975b49d274d1de989f3c2ba0660cba6ab26148"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:19.388076Z","signature_b64":"p3nOwRu+9+HPNqqG50Kd/f2z2bobRGHf1gciGhts0YDP7Pje0+aEsyWpudy04YOQkIpASJEPRiWI6c+kYIZhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b45d06a68618967d7a211f30f93b9117c66a2835a76430469a2196aefa76bd8","last_reissued_at":"2026-05-18T04:32:19.387423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:19.387423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HMC: Verifying Functional Programs Using Abstract Interpreters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andrey Rybalchenko, Ranjit Jhala, Rupak Majumdar","submitted_at":"2010-04-16T17:01:27Z","abstract_excerpt":"We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed higher-order functional programs. HMC works as follows. First, it uses the type structure of the functional program to generate a set of logical refinement constraints whose satisfaction implies the safety of the source program. Next, it transforms the logical refinement constraints into a simple first-order imperative program that is safe iff the constraints are satisfiable. Thus, in one swoop, HMC makes tools for in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2884","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1004.2884","created_at":"2026-05-18T04:32:19.387524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2884v2","created_at":"2026-05-18T04:32:19.387524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2884","created_at":"2026-05-18T04:32:19.387524+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNC5A2TIMGEW","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNC5A2TIMGEWPV5C","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNC5A2TI","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF","json":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF.json","graph_json":"https://pith.science/api/pith-number/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/graph.json","events_json":"https://pith.science/api/pith-number/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/events.json","paper":"https://pith.science/paper/NNC5A2TI"},"agent_actions":{"view_html":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF","download_json":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF.json","view_paper":"https://pith.science/paper/NNC5A2TI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2884&json=true","fetch_graph":"https://pith.science/api/pith-number/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/graph.json","fetch_events":"https://pith.science/api/pith-number/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/action/storage_attestation","attest_author":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/action/author_attestation","sign_citation":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/action/citation_signature","submit_replication":"https://pith.science/pith/NNC5A2TIMGEWPV5CCHZQ7E5ZCF/action/replication_record"}},"created_at":"2026-05-18T04:32:19.387524+00:00","updated_at":"2026-05-18T04:32:19.387524+00:00"}