{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HSQZ4ZNTOEHSMBD2HTRFTFL2PU","short_pith_number":"pith:HSQZ4ZNT","schema_version":"1.0","canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","source":{"kind":"arxiv","id":"1710.09756","version":2},"attestation_state":"computed","paper":{"title":"Linear Haskell: practical linearity in a higher-order polymorphic language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arnaud Spiwack, Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones","submitted_at":"2017-10-26T15:28:32Z","abstract_excerpt":"Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but ca"},"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":"1710.09756","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-10-26T15:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f1cc55a1d4e9f9111a269ce9fa48f7ea0295da8b818c7803e249e7017a97513","abstract_canon_sha256":"bda2ff3597e19d41893e22570155d86259065489d88b50baff7b8a1ab9ff0dfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:02.260446Z","signature_b64":"RhX8lGkrRrtA4VanyUDblEX0I8euJkA0PFTrc+ohiuvmtiGfyZ8uJo8JH/kBG+dAHaku1Z4xKKNM3zVzgEsvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ca19e65b3710f26047a3ce259957a7d33858c5cab25a01316bd06f99080d845","last_reissued_at":"2026-05-18T00:31:02.259747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:02.259747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Haskell: practical linearity in a higher-order polymorphic language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arnaud Spiwack, Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones","submitted_at":"2017-10-26T15:28:32Z","abstract_excerpt":"Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09756","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":"1710.09756","created_at":"2026-05-18T00:31:02.259851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09756v2","created_at":"2026-05-18T00:31:02.259851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09756","created_at":"2026-05-18T00:31:02.259851+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSQZ4ZNTOEHS","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSQZ4ZNTOEHSMBD2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSQZ4ZNT","created_at":"2026-05-18T12:31:18.294218+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/HSQZ4ZNTOEHSMBD2HTRFTFL2PU","json":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU.json","graph_json":"https://pith.science/api/pith-number/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/graph.json","events_json":"https://pith.science/api/pith-number/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/events.json","paper":"https://pith.science/paper/HSQZ4ZNT"},"agent_actions":{"view_html":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU","download_json":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU.json","view_paper":"https://pith.science/paper/HSQZ4ZNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09756&json=true","fetch_graph":"https://pith.science/api/pith-number/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/graph.json","fetch_events":"https://pith.science/api/pith-number/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/action/storage_attestation","attest_author":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/action/author_attestation","sign_citation":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/action/citation_signature","submit_replication":"https://pith.science/pith/HSQZ4ZNTOEHSMBD2HTRFTFL2PU/action/replication_record"}},"created_at":"2026-05-18T00:31:02.259851+00:00","updated_at":"2026-05-18T00:31:02.259851+00:00"}