{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TKY67M4YGLAXVOURIJL25MJQT2","short_pith_number":"pith:TKY67M4Y","schema_version":"1.0","canonical_sha256":"9ab1efb39832c17aba914257aeb1309ea133a2b9918f6fa94b2aa783f66bc79f","source":{"kind":"arxiv","id":"1803.08150","version":3},"attestation_state":"computed","paper":{"title":"Generic Zero-Cost Reuse for Dependent Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aaron Stump, Denis Firsov, Larry Diehl","submitted_at":"2018-03-21T22:02:43Z","abstract_excerpt":"Dependently typed languages are well known for having a problem with code reuse. Traditional non-indexed algebraic datatypes (e.g. lists) appear alongside a plethora of indexed variations (e.g. vectors). Functions are often rewritten for both non-indexed and indexed versions of essentially the same datatype, which is a source of code duplication.\n  We work in a Curry-style dependent type theory, where the same untyped term may be classified as both the non-indexed and indexed versions of a datatype. Many solutions have been proposed for the problem of dependently typed reuse, but we exploit Cu"},"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":"1803.08150","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-03-21T22:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"5526531305b9b216bd7ace336b4aa8bbecefd4ffa04605a44fc0fbc8cec7b906","abstract_canon_sha256":"ee97fabe0b6526f31349f289e39086150f280048960d6bf7c52de52952465ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:11.149389Z","signature_b64":"QssTrM95Y2YZ6czq57t6omiUN7tsEuond5VTVbMF7jZQZD/kl0UcAGBsTKoXcEWx8TI1TUVwJAVyglDjJb2sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab1efb39832c17aba914257aeb1309ea133a2b9918f6fa94b2aa783f66bc79f","last_reissued_at":"2026-05-18T00:11:11.148656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:11.148656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generic Zero-Cost Reuse for Dependent Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aaron Stump, Denis Firsov, Larry Diehl","submitted_at":"2018-03-21T22:02:43Z","abstract_excerpt":"Dependently typed languages are well known for having a problem with code reuse. Traditional non-indexed algebraic datatypes (e.g. lists) appear alongside a plethora of indexed variations (e.g. vectors). Functions are often rewritten for both non-indexed and indexed versions of essentially the same datatype, which is a source of code duplication.\n  We work in a Curry-style dependent type theory, where the same untyped term may be classified as both the non-indexed and indexed versions of a datatype. Many solutions have been proposed for the problem of dependently typed reuse, but we exploit Cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08150","kind":"arxiv","version":3},"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":"1803.08150","created_at":"2026-05-18T00:11:11.148784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08150v3","created_at":"2026-05-18T00:11:11.148784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08150","created_at":"2026-05-18T00:11:11.148784+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKY67M4YGLAX","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKY67M4YGLAXVOUR","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKY67M4Y","created_at":"2026-05-18T12:32:53.628368+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/TKY67M4YGLAXVOURIJL25MJQT2","json":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2.json","graph_json":"https://pith.science/api/pith-number/TKY67M4YGLAXVOURIJL25MJQT2/graph.json","events_json":"https://pith.science/api/pith-number/TKY67M4YGLAXVOURIJL25MJQT2/events.json","paper":"https://pith.science/paper/TKY67M4Y"},"agent_actions":{"view_html":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2","download_json":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2.json","view_paper":"https://pith.science/paper/TKY67M4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08150&json=true","fetch_graph":"https://pith.science/api/pith-number/TKY67M4YGLAXVOURIJL25MJQT2/graph.json","fetch_events":"https://pith.science/api/pith-number/TKY67M4YGLAXVOURIJL25MJQT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2/action/storage_attestation","attest_author":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2/action/author_attestation","sign_citation":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2/action/citation_signature","submit_replication":"https://pith.science/pith/TKY67M4YGLAXVOURIJL25MJQT2/action/replication_record"}},"created_at":"2026-05-18T00:11:11.148784+00:00","updated_at":"2026-05-18T00:11:11.148784+00:00"}