{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FWVHGGPM56ZMNGMNVXK33XSEGY","short_pith_number":"pith:FWVHGGPM","schema_version":"1.0","canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","source":{"kind":"arxiv","id":"2605.23022","version":1},"attestation_state":"computed","paper":{"title":"Complete first-order reasoning for functional programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Adithya Murali, Lucas Pe\\~na, P. Madhusudan, Ranjit Jhala","submitted_at":"2026-05-21T20:47:07Z","abstract_excerpt":"Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function definitions followed by quantifier-free reasoning using SMT solvers. We uncover foundational theoretical properties of this heuristic, revealing that it can be generalized and formalized as a technique that is in fact complete for reasoning with combined First-Order theories of algebraic datatypes and background theories, where background theories support decidable quantifier-free reasoning. The theory developed 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":"2605.23022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-21T20:47:07Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"098d2c4deac02649ef98808f6ab054c87f0e4a14b136247ffea9cf26b5fbf6a7","abstract_canon_sha256":"a1b4cf6e56c5d85dbc0d1ec733c09515bcd4431b43cd4cf5480cdfdb342ddc84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:35.054510Z","signature_b64":"5pVh/TsWb3mWy6idtzsP13N6ydnxmMKPWw9qd2pH8twFHXPI9AFfZuBpx1R9NKYWr7x50w96g+8lrMRTnhfzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2daa7319ecefb2c6998dadd5bdde44363cf1f70b599abb6bf144148732f2aa4c","last_reissued_at":"2026-05-25T02:01:35.053835Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:35.053835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete first-order reasoning for functional programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Adithya Murali, Lucas Pe\\~na, P. Madhusudan, Ranjit Jhala","submitted_at":"2026-05-21T20:47:07Z","abstract_excerpt":"Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function definitions followed by quantifier-free reasoning using SMT solvers. We uncover foundational theoretical properties of this heuristic, revealing that it can be generalized and formalized as a technique that is in fact complete for reasoning with combined First-Order theories of algebraic datatypes and background theories, where background theories support decidable quantifier-free reasoning. The theory developed in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23022","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23022/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.23022","created_at":"2026-05-25T02:01:35.053938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23022v1","created_at":"2026-05-25T02:01:35.053938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23022","created_at":"2026-05-25T02:01:35.053938+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWVHGGPM56ZM","created_at":"2026-05-25T02:01:35.053938+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWVHGGPM56ZMNGMN","created_at":"2026-05-25T02:01:35.053938+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWVHGGPM","created_at":"2026-05-25T02:01:35.053938+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/FWVHGGPM56ZMNGMNVXK33XSEGY","json":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY.json","graph_json":"https://pith.science/api/pith-number/FWVHGGPM56ZMNGMNVXK33XSEGY/graph.json","events_json":"https://pith.science/api/pith-number/FWVHGGPM56ZMNGMNVXK33XSEGY/events.json","paper":"https://pith.science/paper/FWVHGGPM"},"agent_actions":{"view_html":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY","download_json":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY.json","view_paper":"https://pith.science/paper/FWVHGGPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23022&json=true","fetch_graph":"https://pith.science/api/pith-number/FWVHGGPM56ZMNGMNVXK33XSEGY/graph.json","fetch_events":"https://pith.science/api/pith-number/FWVHGGPM56ZMNGMNVXK33XSEGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/action/storage_attestation","attest_author":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/action/author_attestation","sign_citation":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/action/citation_signature","submit_replication":"https://pith.science/pith/FWVHGGPM56ZMNGMNVXK33XSEGY/action/replication_record"}},"created_at":"2026-05-25T02:01:35.053938+00:00","updated_at":"2026-05-25T02:01:35.053938+00:00"}