{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5P5XUNXOUVOT5OM7XUIZY2KP5J","short_pith_number":"pith:5P5XUNXO","schema_version":"1.0","canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","source":{"kind":"arxiv","id":"1609.09709","version":1},"attestation_state":"computed","paper":{"title":"Type checking through unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andreas Abel, Francesco Mazzoli","submitted_at":"2016-09-30T13:03:25Z","abstract_excerpt":"In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to check definitional equality of terms while type checking gives rise to a tight interplay between type checking and unification. This interplay is a major source of complexity in the type-checking algorithm for existing dependently typed programming languages. We propose an algorithm that encodes a type-checking problem entirely in the form of unification constra"},"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":"1609.09709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-30T13:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"80c9a9e5e98f41d9293480587dbf4497f1b0542eebf63dd76375b7025a8c8688","abstract_canon_sha256":"e90fa51c29651b436af67f15202085f22b35a1ed14cd2e0785bfd824f844336c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:33.619776Z","signature_b64":"B0k0n1ZnNuK3qovZBQedoGHyb7owoErFOXqysjgkiYpywP4qENZQHnEv0SNxHiXLKNSTfDKQ9IzMWWUNxe12Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","last_reissued_at":"2026-05-18T01:03:33.619180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:33.619180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Type checking through unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andreas Abel, Francesco Mazzoli","submitted_at":"2016-09-30T13:03:25Z","abstract_excerpt":"In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to check definitional equality of terms while type checking gives rise to a tight interplay between type checking and unification. This interplay is a major source of complexity in the type-checking algorithm for existing dependently typed programming languages. We propose an algorithm that encodes a type-checking problem entirely in the form of unification constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09709","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":""},"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":"1609.09709","created_at":"2026-05-18T01:03:33.619286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09709v1","created_at":"2026-05-18T01:03:33.619286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09709","created_at":"2026-05-18T01:03:33.619286+00:00"},{"alias_kind":"pith_short_12","alias_value":"5P5XUNXOUVOT","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5P5XUNXOUVOT5OM7","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5P5XUNXO","created_at":"2026-05-18T12:30:01.593930+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/5P5XUNXOUVOT5OM7XUIZY2KP5J","json":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J.json","graph_json":"https://pith.science/api/pith-number/5P5XUNXOUVOT5OM7XUIZY2KP5J/graph.json","events_json":"https://pith.science/api/pith-number/5P5XUNXOUVOT5OM7XUIZY2KP5J/events.json","paper":"https://pith.science/paper/5P5XUNXO"},"agent_actions":{"view_html":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J","download_json":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J.json","view_paper":"https://pith.science/paper/5P5XUNXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09709&json=true","fetch_graph":"https://pith.science/api/pith-number/5P5XUNXOUVOT5OM7XUIZY2KP5J/graph.json","fetch_events":"https://pith.science/api/pith-number/5P5XUNXOUVOT5OM7XUIZY2KP5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/action/storage_attestation","attest_author":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/action/author_attestation","sign_citation":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/action/citation_signature","submit_replication":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/action/replication_record"}},"created_at":"2026-05-18T01:03:33.619286+00:00","updated_at":"2026-05-18T01:03:33.619286+00:00"}