{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3HCTHLTMWVQ5ZSCMA5NSQUPBTE","short_pith_number":"pith:3HCTHLTM","schema_version":"1.0","canonical_sha256":"d9c533ae6cb561dcc84c075b2851e1991ecf763dd2fb75cfb3f25eca52b26f2a","source":{"kind":"arxiv","id":"1208.0535","version":1},"attestation_state":"computed","paper":{"title":"Modular Type-Safety Proofs using Dependant Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christopher Schwaab, Jeremy G. Siek","submitted_at":"2012-08-02T16:38:13Z","abstract_excerpt":"While methods of code abstraction and reuse are widespread and well researched, methods of proof abstraction and reuse are still emerging. We consider the use of dependent types for this purpose, introducing a completely mechanical approach to proof composition. We show that common techniques for abstracting algorithms over data structures naturally translate to abstractions over proofs. We first introduce a language composed of a series of smaller language components tied together by standard techniques from Malcom (1990). We proceed by giving proofs of type preservation for each language com"},"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":"1208.0535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-08-02T16:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"01652a2a8f4fcc11f9b861bf0d176c338df0f1d51ce8adca418f48bc0b38c72c","abstract_canon_sha256":"98ccc25b32d87ab171a0fee875e4fbf0455e9473d52c62f98f4bc7f06d1b9368"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:33.855873Z","signature_b64":"p54deNq2KNCw2PxOuUwQgOfY2cNImOlxGNO8JsX+HlsMne3C04olGstKWdsIcNL2vi45PMCKBprJsbNh8o8ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c533ae6cb561dcc84c075b2851e1991ecf763dd2fb75cfb3f25eca52b26f2a","last_reissued_at":"2026-05-18T03:49:33.854937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:33.854937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Type-Safety Proofs using Dependant Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christopher Schwaab, Jeremy G. Siek","submitted_at":"2012-08-02T16:38:13Z","abstract_excerpt":"While methods of code abstraction and reuse are widespread and well researched, methods of proof abstraction and reuse are still emerging. We consider the use of dependent types for this purpose, introducing a completely mechanical approach to proof composition. We show that common techniques for abstracting algorithms over data structures naturally translate to abstractions over proofs. We first introduce a language composed of a series of smaller language components tied together by standard techniques from Malcom (1990). We proceed by giving proofs of type preservation for each language com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0535","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":"1208.0535","created_at":"2026-05-18T03:49:33.855074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0535v1","created_at":"2026-05-18T03:49:33.855074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0535","created_at":"2026-05-18T03:49:33.855074+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HCTHLTMWVQ5","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HCTHLTMWVQ5ZSCM","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HCTHLTM","created_at":"2026-05-18T12:26:50.516681+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/3HCTHLTMWVQ5ZSCMA5NSQUPBTE","json":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE.json","graph_json":"https://pith.science/api/pith-number/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/graph.json","events_json":"https://pith.science/api/pith-number/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/events.json","paper":"https://pith.science/paper/3HCTHLTM"},"agent_actions":{"view_html":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE","download_json":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE.json","view_paper":"https://pith.science/paper/3HCTHLTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0535&json=true","fetch_graph":"https://pith.science/api/pith-number/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/graph.json","fetch_events":"https://pith.science/api/pith-number/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/action/storage_attestation","attest_author":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/action/author_attestation","sign_citation":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/action/citation_signature","submit_replication":"https://pith.science/pith/3HCTHLTMWVQ5ZSCMA5NSQUPBTE/action/replication_record"}},"created_at":"2026-05-18T03:49:33.855074+00:00","updated_at":"2026-05-18T03:49:33.855074+00:00"}