{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ABSRLTUTLCBP6LHHWNEW67HTPM","short_pith_number":"pith:ABSRLTUT","schema_version":"1.0","canonical_sha256":"006515ce935882ff2ce7b3496f7cf37b08e8bb396a8e76feedc0eecce21e5033","source":{"kind":"arxiv","id":"1401.1460","version":5},"attestation_state":"computed","paper":{"title":"Maximal Sharing in the Lambda Calculus with letrec","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Clemens Grabmayer, Jan Rochel","submitted_at":"2014-01-07T18:01:41Z","abstract_excerpt":"Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. We introduce a notion of `maximal compactness' for lambda-letrec-terms among all terms with the same infinite unfolding. Instead of defined purely syntactically, this notion is based on a graph semantics. lambda-letrec-terms are interpreted as first-order term graphs so that unfolding equivalence between terms is preser"},"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":"1401.1460","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.PL","submitted_at":"2014-01-07T18:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"4d02d51a3891a2d167345b684b80af6ee418868ecf8c4d9051b880219b11b4f5","abstract_canon_sha256":"1adf936f67c836de66b5f4504d644b1c0d436f8ae28f1e44dcf78a72a28781d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.784391Z","signature_b64":"C2U3dYkIalHNEvkAEIakqrtKcA8p04CWnBOf+tDAr+pWrusD0Nf4zazneaxinFhb33Jil364/se/D+ppcnnECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006515ce935882ff2ce7b3496f7cf37b08e8bb396a8e76feedc0eecce21e5033","last_reissued_at":"2026-05-18T01:25:24.783794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.783794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Sharing in the Lambda Calculus with letrec","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Clemens Grabmayer, Jan Rochel","submitted_at":"2014-01-07T18:01:41Z","abstract_excerpt":"Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. We introduce a notion of `maximal compactness' for lambda-letrec-terms among all terms with the same infinite unfolding. Instead of defined purely syntactically, this notion is based on a graph semantics. lambda-letrec-terms are interpreted as first-order term graphs so that unfolding equivalence between terms is preser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1460","kind":"arxiv","version":5},"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":"1401.1460","created_at":"2026-05-18T01:25:24.783875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1460v5","created_at":"2026-05-18T01:25:24.783875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1460","created_at":"2026-05-18T01:25:24.783875+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABSRLTUTLCBP","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABSRLTUTLCBP6LHH","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABSRLTUT","created_at":"2026-05-18T12:28:19.803747+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/ABSRLTUTLCBP6LHHWNEW67HTPM","json":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM.json","graph_json":"https://pith.science/api/pith-number/ABSRLTUTLCBP6LHHWNEW67HTPM/graph.json","events_json":"https://pith.science/api/pith-number/ABSRLTUTLCBP6LHHWNEW67HTPM/events.json","paper":"https://pith.science/paper/ABSRLTUT"},"agent_actions":{"view_html":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM","download_json":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM.json","view_paper":"https://pith.science/paper/ABSRLTUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1460&json=true","fetch_graph":"https://pith.science/api/pith-number/ABSRLTUTLCBP6LHHWNEW67HTPM/graph.json","fetch_events":"https://pith.science/api/pith-number/ABSRLTUTLCBP6LHHWNEW67HTPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM/action/storage_attestation","attest_author":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM/action/author_attestation","sign_citation":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM/action/citation_signature","submit_replication":"https://pith.science/pith/ABSRLTUTLCBP6LHHWNEW67HTPM/action/replication_record"}},"created_at":"2026-05-18T01:25:24.783875+00:00","updated_at":"2026-05-18T01:25:24.783875+00:00"}