{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:REWTQR334OHBABITXLQK3RHCQR","short_pith_number":"pith:REWTQR33","schema_version":"1.0","canonical_sha256":"892d38477be38e100513bae0adc4e284629694a197aef0fbe99f6f9bab1bd315","source":{"kind":"arxiv","id":"1802.06375","version":1},"attestation_state":"computed","paper":{"title":"Efficient Gradual Typing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andre Kuhlenschmidt, Deyaaeldeen Almahallawi, Jeremy G. Siek","submitted_at":"2018-02-18T13:30:45Z","abstract_excerpt":"Gradual typing combines static and dynamic typing in the same program. One would hope that the performance in a gradually typed language would range between that of a dynamically typed language and a statically typed language. Existing implementations of gradually typed languages have not achieved this goal due to overheads associated with runtime casts. Takikawa et al. (2016) report up to 100$\\times$ slowdowns for partially typed programs. In this paper we present a compiler, named Grift, for evaluating implementation techniques for gradual typing. We take a straightforward but surprisingly u"},"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":"1802.06375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-18T13:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"42c5db53402b2bcffe48a590f936677acd773ae27c6f0ceb970941ca28d7faa4","abstract_canon_sha256":"22670c670851135077b1ebb6b7a11f2ab1fa238287bf9da909acf1a25da92b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.425728Z","signature_b64":"ghmzdrM3Xllo3l8qnltJjWk9WICllZ6ztZRIf3ilp/qWsiYb4Oo0VfvoDNbv5GX11dbRgHWf5jOTezWtVjp2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"892d38477be38e100513bae0adc4e284629694a197aef0fbe99f6f9bab1bd315","last_reissued_at":"2026-05-18T00:23:03.425072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.425072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Gradual Typing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andre Kuhlenschmidt, Deyaaeldeen Almahallawi, Jeremy G. Siek","submitted_at":"2018-02-18T13:30:45Z","abstract_excerpt":"Gradual typing combines static and dynamic typing in the same program. One would hope that the performance in a gradually typed language would range between that of a dynamically typed language and a statically typed language. Existing implementations of gradually typed languages have not achieved this goal due to overheads associated with runtime casts. Takikawa et al. (2016) report up to 100$\\times$ slowdowns for partially typed programs. In this paper we present a compiler, named Grift, for evaluating implementation techniques for gradual typing. We take a straightforward but surprisingly u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06375","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":"1802.06375","created_at":"2026-05-18T00:23:03.425178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06375v1","created_at":"2026-05-18T00:23:03.425178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06375","created_at":"2026-05-18T00:23:03.425178+00:00"},{"alias_kind":"pith_short_12","alias_value":"REWTQR334OHB","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"REWTQR334OHBABIT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"REWTQR33","created_at":"2026-05-18T12:32:50.500415+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/REWTQR334OHBABITXLQK3RHCQR","json":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR.json","graph_json":"https://pith.science/api/pith-number/REWTQR334OHBABITXLQK3RHCQR/graph.json","events_json":"https://pith.science/api/pith-number/REWTQR334OHBABITXLQK3RHCQR/events.json","paper":"https://pith.science/paper/REWTQR33"},"agent_actions":{"view_html":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR","download_json":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR.json","view_paper":"https://pith.science/paper/REWTQR33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06375&json=true","fetch_graph":"https://pith.science/api/pith-number/REWTQR334OHBABITXLQK3RHCQR/graph.json","fetch_events":"https://pith.science/api/pith-number/REWTQR334OHBABITXLQK3RHCQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR/action/storage_attestation","attest_author":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR/action/author_attestation","sign_citation":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR/action/citation_signature","submit_replication":"https://pith.science/pith/REWTQR334OHBABITXLQK3RHCQR/action/replication_record"}},"created_at":"2026-05-18T00:23:03.425178+00:00","updated_at":"2026-05-18T00:23:03.425178+00:00"}