{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4KA54V2RYFSCAPMJFEDAMYH2LL","short_pith_number":"pith:4KA54V2R","schema_version":"1.0","canonical_sha256":"e281de5751c164203d8929060660fa5adbe88604f841b62d16e3994913e851a8","source":{"kind":"arxiv","id":"1304.6284","version":3},"attestation_state":"computed","paper":{"title":"Expressibility in the Lambda Calculus with mu","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Clemens Grabmayer, Jan Rochel","submitted_at":"2013-04-23T13:26:02Z","abstract_excerpt":"We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite unfoldings of terms in lambda_{letrec}, the lambda-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite lambda-terms: regularity, strong regularity, and binding-capturing chains. It turns out that lambda_{letrec}-expressible infinite lambda-terms form a proper subclass of the regular infinite lambda-terms. In this paper"},"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":"1304.6284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-04-23T13:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"81b8a4c1020b84ab0944f549d5b6450d4bdb3ebd9157e29cf1c3ae57554f7ac4","abstract_canon_sha256":"4a5ca905f4c87bd793be922088b1960819346e3e2bb3253aacae42cf59d43a6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:52.282415Z","signature_b64":"+920LcmvEPHOhjEOj8Iwwf4w508qkyW/sA1MzHYGwbRXUn9f6a06G0/iKEgITWAfPQ4FG/FYk9F+GQqcjQO0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e281de5751c164203d8929060660fa5adbe88604f841b62d16e3994913e851a8","last_reissued_at":"2026-05-18T03:24:52.281760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:52.281760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expressibility in the Lambda Calculus with mu","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Clemens Grabmayer, Jan Rochel","submitted_at":"2013-04-23T13:26:02Z","abstract_excerpt":"We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite unfoldings of terms in lambda_{letrec}, the lambda-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite lambda-terms: regularity, strong regularity, and binding-capturing chains. It turns out that lambda_{letrec}-expressible infinite lambda-terms form a proper subclass of the regular infinite lambda-terms. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6284","kind":"arxiv","version":3},"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":"1304.6284","created_at":"2026-05-18T03:24:52.281861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6284v3","created_at":"2026-05-18T03:24:52.281861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6284","created_at":"2026-05-18T03:24:52.281861+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KA54V2RYFSC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KA54V2RYFSCAPMJ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KA54V2R","created_at":"2026-05-18T12:27:34.582898+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/4KA54V2RYFSCAPMJFEDAMYH2LL","json":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL.json","graph_json":"https://pith.science/api/pith-number/4KA54V2RYFSCAPMJFEDAMYH2LL/graph.json","events_json":"https://pith.science/api/pith-number/4KA54V2RYFSCAPMJFEDAMYH2LL/events.json","paper":"https://pith.science/paper/4KA54V2R"},"agent_actions":{"view_html":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL","download_json":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL.json","view_paper":"https://pith.science/paper/4KA54V2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6284&json=true","fetch_graph":"https://pith.science/api/pith-number/4KA54V2RYFSCAPMJFEDAMYH2LL/graph.json","fetch_events":"https://pith.science/api/pith-number/4KA54V2RYFSCAPMJFEDAMYH2LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL/action/storage_attestation","attest_author":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL/action/author_attestation","sign_citation":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL/action/citation_signature","submit_replication":"https://pith.science/pith/4KA54V2RYFSCAPMJFEDAMYH2LL/action/replication_record"}},"created_at":"2026-05-18T03:24:52.281861+00:00","updated_at":"2026-05-18T03:24:52.281861+00:00"}