{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:43CXNZ5NQGSSLPG2IEYMUNLQES","short_pith_number":"pith:43CXNZ5N","schema_version":"1.0","canonical_sha256":"e6c576e7ad81a525bcda4130ca35702497947f30b25629f63675950230e85c88","source":{"kind":"arxiv","id":"1306.6032","version":2},"attestation_state":"computed","paper":{"title":"Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jana Dunfield, Neelakantan R. Krishnaswami","submitted_at":"2013-06-25T16:52:51Z","abstract_excerpt":"Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very expressive type systems), its error reporting, and its relative ease of implementation. Following design principles from proof theory, bidirectional typing can be applied to many type constructs. The principles underlying a bidirectional approach to polymorphism, however, are less obvious. We give a declarative, bidirectional account of higher-rank polymorphism, g"},"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":"1306.6032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-25T16:52:51Z","cross_cats_sorted":[],"title_canon_sha256":"054d09c176ac8f1e48f68337fb647564bd93c30a1466b684e42ae348155b4ed3","abstract_canon_sha256":"c278efe17d14d42368ddabf7190796c6d79684adf036b4dcf793e86705aa65fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:56.911253Z","signature_b64":"WUu1WpuKuvvc5KpxBTz7ZSdBLkcgYeFYM/y8daQ0FdJ0xcznP1Bv+AlHWnTnAPe6CtoF8h+fLFaIfKdhq/FTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6c576e7ad81a525bcda4130ca35702497947f30b25629f63675950230e85c88","last_reissued_at":"2026-07-05T01:28:56.910834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:56.910834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jana Dunfield, Neelakantan R. Krishnaswami","submitted_at":"2013-06-25T16:52:51Z","abstract_excerpt":"Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very expressive type systems), its error reporting, and its relative ease of implementation. Following design principles from proof theory, bidirectional typing can be applied to many type constructs. The principles underlying a bidirectional approach to polymorphism, however, are less obvious. We give a declarative, bidirectional account of higher-rank polymorphism, g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1306.6032/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":"1306.6032","created_at":"2026-07-05T01:28:56.910898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6032v2","created_at":"2026-07-05T01:28:56.910898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6032","created_at":"2026-07-05T01:28:56.910898+00:00"},{"alias_kind":"pith_short_12","alias_value":"43CXNZ5NQGSS","created_at":"2026-07-05T01:28:56.910898+00:00"},{"alias_kind":"pith_short_16","alias_value":"43CXNZ5NQGSSLPG2","created_at":"2026-07-05T01:28:56.910898+00:00"},{"alias_kind":"pith_short_8","alias_value":"43CXNZ5N","created_at":"2026-07-05T01:28:56.910898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05839","citing_title":"Bidirectional Typing","ref_index":2013,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES","json":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES.json","graph_json":"https://pith.science/api/pith-number/43CXNZ5NQGSSLPG2IEYMUNLQES/graph.json","events_json":"https://pith.science/api/pith-number/43CXNZ5NQGSSLPG2IEYMUNLQES/events.json","paper":"https://pith.science/paper/43CXNZ5N"},"agent_actions":{"view_html":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES","download_json":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES.json","view_paper":"https://pith.science/paper/43CXNZ5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6032&json=true","fetch_graph":"https://pith.science/api/pith-number/43CXNZ5NQGSSLPG2IEYMUNLQES/graph.json","fetch_events":"https://pith.science/api/pith-number/43CXNZ5NQGSSLPG2IEYMUNLQES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES/action/storage_attestation","attest_author":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES/action/author_attestation","sign_citation":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES/action/citation_signature","submit_replication":"https://pith.science/pith/43CXNZ5NQGSSLPG2IEYMUNLQES/action/replication_record"}},"created_at":"2026-07-05T01:28:56.910898+00:00","updated_at":"2026-07-05T01:28:56.910898+00:00"}