{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3KW2ZWMJSL7D5ZRUCYL4BFAWMR","short_pith_number":"pith:3KW2ZWMJ","schema_version":"1.0","canonical_sha256":"daadacd98992fe3ee6341617c09416645e0ec4477e42fdb2376620e1def4a634","source":{"kind":"arxiv","id":"1606.01106","version":2},"attestation_state":"computed","paper":{"title":"Set-Theoretic Types for Polymorphic Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"DIBRIS), Giuseppe Castagna (CNRS, IRIF), Kim Nguyen (LRI), Tommaso Petrucciani (IRIF","submitted_at":"2016-06-03T14:34:55Z","abstract_excerpt":"Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a type system whose behaviour is in some cases unintuitive and/or unduly restrictive. In this work, we present an alternative formalization of poly-morphic variants, based on set-theoretic types and subtyping, that yields a cleaner and more streamlined system. Our formalization is more expressive than the current one (it types more programs while preserving ty"},"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":"1606.01106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-06-03T14:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"a50147ddd8fd7513322997cb8a61c344fc8c9f817f0f3a935218ddb32d79b38b","abstract_canon_sha256":"461c210c028f25ec1a8fd1f42fddb0ec1b461dd16a5e61d81b2276225dd61b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:30.498422Z","signature_b64":"8QCL4D8Y4V/yt0HausY2vKHb4ynfxkqxS2zSuudmD7jz2J3WXmwFSDxSNCi9mclIvInyQiOD0ch1z8y0DMa8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daadacd98992fe3ee6341617c09416645e0ec4477e42fdb2376620e1def4a634","last_reissued_at":"2026-05-18T01:11:30.498071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:30.498071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set-Theoretic Types for Polymorphic Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"DIBRIS), Giuseppe Castagna (CNRS, IRIF), Kim Nguyen (LRI), Tommaso Petrucciani (IRIF","submitted_at":"2016-06-03T14:34:55Z","abstract_excerpt":"Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a type system whose behaviour is in some cases unintuitive and/or unduly restrictive. In this work, we present an alternative formalization of poly-morphic variants, based on set-theoretic types and subtyping, that yields a cleaner and more streamlined system. Our formalization is more expressive than the current one (it types more programs while preserving ty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01106","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":"1606.01106","created_at":"2026-05-18T01:11:30.498128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01106v2","created_at":"2026-05-18T01:11:30.498128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01106","created_at":"2026-05-18T01:11:30.498128+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KW2ZWMJSL7D","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KW2ZWMJSL7D5ZRU","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KW2ZWMJ","created_at":"2026-05-18T12:29:55.572404+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/3KW2ZWMJSL7D5ZRUCYL4BFAWMR","json":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR.json","graph_json":"https://pith.science/api/pith-number/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/graph.json","events_json":"https://pith.science/api/pith-number/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/events.json","paper":"https://pith.science/paper/3KW2ZWMJ"},"agent_actions":{"view_html":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR","download_json":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR.json","view_paper":"https://pith.science/paper/3KW2ZWMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01106&json=true","fetch_graph":"https://pith.science/api/pith-number/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/graph.json","fetch_events":"https://pith.science/api/pith-number/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/action/storage_attestation","attest_author":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/action/author_attestation","sign_citation":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/action/citation_signature","submit_replication":"https://pith.science/pith/3KW2ZWMJSL7D5ZRUCYL4BFAWMR/action/replication_record"}},"created_at":"2026-05-18T01:11:30.498128+00:00","updated_at":"2026-05-18T01:11:30.498128+00:00"}