{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3LO2OUUW7VURCTJIEBWN53ZLNH","short_pith_number":"pith:3LO2OUUW","schema_version":"1.0","canonical_sha256":"dadda75296fd69114d28206cdeef2b69c4b9eb96458ae28cd3d64eb5b3594e55","source":{"kind":"arxiv","id":"1102.2656","version":1},"attestation_state":"computed","paper":{"title":"Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Clemens Grabmayer (Utrecht University, Jan Rochel (Utrecht University, the Netherlands)","submitted_at":"2011-02-14T01:09:58Z","abstract_excerpt":"For the lambda-calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of 'future' (also: virtual) redexes.\n  In the implementation of functional programming languages it is common practice to perform beta-reductions at compile time whenever possible in order to produce code that requires fewer reductions at run time. This is, however, in principle limited to redexes and created redexes that are 'visible' (in the sense that they can be contracted without the need for unsharing), and cannot generally be extended to redexes that are concealed by shar"},"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":"1102.2656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-02-14T01:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"bb10c2e401c6cedefc87fdcdb74fd9643962013f1d94d1ab1eb815e378f4022c","abstract_canon_sha256":"5907515300241fccd2fdcf07f58cc0b1ca97a71104274ca11bd71a60cbeaca6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:46.799549Z","signature_b64":"+pSJF2BUHNWP0fENm02uLiy0YWFnetFkYxZJEvd+NHXFGwZz0O9h39x/7HnfrXK7AZ+BXmmf8mfUdOahvhO8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dadda75296fd69114d28206cdeef2b69c4b9eb96458ae28cd3d64eb5b3594e55","last_reissued_at":"2026-05-18T04:28:46.799033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:46.799033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Clemens Grabmayer (Utrecht University, Jan Rochel (Utrecht University, the Netherlands)","submitted_at":"2011-02-14T01:09:58Z","abstract_excerpt":"For the lambda-calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of 'future' (also: virtual) redexes.\n  In the implementation of functional programming languages it is common practice to perform beta-reductions at compile time whenever possible in order to produce code that requires fewer reductions at run time. This is, however, in principle limited to redexes and created redexes that are 'visible' (in the sense that they can be contracted without the need for unsharing), and cannot generally be extended to redexes that are concealed by shar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2656","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":"1102.2656","created_at":"2026-05-18T04:28:46.799119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2656v1","created_at":"2026-05-18T04:28:46.799119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2656","created_at":"2026-05-18T04:28:46.799119+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LO2OUUW7VUR","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LO2OUUW7VURCTJI","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LO2OUUW","created_at":"2026-05-18T12:26:18.847500+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/3LO2OUUW7VURCTJIEBWN53ZLNH","json":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH.json","graph_json":"https://pith.science/api/pith-number/3LO2OUUW7VURCTJIEBWN53ZLNH/graph.json","events_json":"https://pith.science/api/pith-number/3LO2OUUW7VURCTJIEBWN53ZLNH/events.json","paper":"https://pith.science/paper/3LO2OUUW"},"agent_actions":{"view_html":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH","download_json":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH.json","view_paper":"https://pith.science/paper/3LO2OUUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2656&json=true","fetch_graph":"https://pith.science/api/pith-number/3LO2OUUW7VURCTJIEBWN53ZLNH/graph.json","fetch_events":"https://pith.science/api/pith-number/3LO2OUUW7VURCTJIEBWN53ZLNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH/action/storage_attestation","attest_author":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH/action/author_attestation","sign_citation":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH/action/citation_signature","submit_replication":"https://pith.science/pith/3LO2OUUW7VURCTJIEBWN53ZLNH/action/replication_record"}},"created_at":"2026-05-18T04:28:46.799119+00:00","updated_at":"2026-05-18T04:28:46.799119+00:00"}