{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JMFY7VVLAYPCZNOKCZZPDBSDLH","short_pith_number":"pith:JMFY7VVL","schema_version":"1.0","canonical_sha256":"4b0b8fd6ab061e2cb5ca1672f1864359d33fd1253d577411e6561bd5e9a76b91","source":{"kind":"arxiv","id":"1711.04718","version":1},"attestation_state":"computed","paper":{"title":"A Type Checking Algorithm for Higher-rank, Impredicative and Second-order Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Peng Fu","submitted_at":"2017-11-13T17:30:12Z","abstract_excerpt":"We study a type checking algorithm that is able to type check a nontrivial subclass of functional programs that use features such as higher-rank, impredicative and second-order types. The only place the algorithm requires type annotation is before each function declaration. We prove the soundness of the type checking algorithm with respect to System $\\mathbf{F}_{\\omega}$, i.e. if the program is type checked, then the type checker will produce a well-typed annotated System $\\mathbf{F}_{\\omega}$ term. We extend the basic algorithm to handle pattern matching and let-bindings. We implement a proto"},"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":"1711.04718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-13T17:30:12Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"08d0735b5a54806ade69288f58c1aef026ff5873abf2e4d0dd07a9ee481087a8","abstract_canon_sha256":"6aba6f3595c5e79a2b79732c734edcf4eafade1849c6a2d4f170c207cd61bc18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:35.857277Z","signature_b64":"Bmj/JQSJUKGr7yi8halXlfT6Mjvq2fRxy/f11NSARMQMpI0gRXsGV91rdWV/wjq/3oJIQ58IvrdWjhn2t7deBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0b8fd6ab061e2cb5ca1672f1864359d33fd1253d577411e6561bd5e9a76b91","last_reissued_at":"2026-05-18T00:30:35.856729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:35.856729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Type Checking Algorithm for Higher-rank, Impredicative and Second-order Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Peng Fu","submitted_at":"2017-11-13T17:30:12Z","abstract_excerpt":"We study a type checking algorithm that is able to type check a nontrivial subclass of functional programs that use features such as higher-rank, impredicative and second-order types. The only place the algorithm requires type annotation is before each function declaration. We prove the soundness of the type checking algorithm with respect to System $\\mathbf{F}_{\\omega}$, i.e. if the program is type checked, then the type checker will produce a well-typed annotated System $\\mathbf{F}_{\\omega}$ term. We extend the basic algorithm to handle pattern matching and let-bindings. We implement a proto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04718","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":"1711.04718","created_at":"2026-05-18T00:30:35.856803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04718v1","created_at":"2026-05-18T00:30:35.856803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04718","created_at":"2026-05-18T00:30:35.856803+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMFY7VVLAYPC","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMFY7VVLAYPCZNOK","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMFY7VVL","created_at":"2026-05-18T12:31:24.725408+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/JMFY7VVLAYPCZNOKCZZPDBSDLH","json":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH.json","graph_json":"https://pith.science/api/pith-number/JMFY7VVLAYPCZNOKCZZPDBSDLH/graph.json","events_json":"https://pith.science/api/pith-number/JMFY7VVLAYPCZNOKCZZPDBSDLH/events.json","paper":"https://pith.science/paper/JMFY7VVL"},"agent_actions":{"view_html":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH","download_json":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH.json","view_paper":"https://pith.science/paper/JMFY7VVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04718&json=true","fetch_graph":"https://pith.science/api/pith-number/JMFY7VVLAYPCZNOKCZZPDBSDLH/graph.json","fetch_events":"https://pith.science/api/pith-number/JMFY7VVLAYPCZNOKCZZPDBSDLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH/action/storage_attestation","attest_author":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH/action/author_attestation","sign_citation":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH/action/citation_signature","submit_replication":"https://pith.science/pith/JMFY7VVLAYPCZNOKCZZPDBSDLH/action/replication_record"}},"created_at":"2026-05-18T00:30:35.856803+00:00","updated_at":"2026-05-18T00:30:35.856803+00:00"}