{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ULDVVYIGCYRFK2U2LMXOWXXPZM","short_pith_number":"pith:ULDVVYIG","schema_version":"1.0","canonical_sha256":"a2c75ae1061622556a9a5b2eeb5eefcb0fa765ff558ab2136f0236c4207a2aee","source":{"kind":"arxiv","id":"1201.4567","version":2},"attestation_state":"computed","paper":{"title":"Ramified Structural Recursion and Corecursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"James S. Royer, Norman Danner","submitted_at":"2012-01-22T16:06:01Z","abstract_excerpt":"We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni-Cook-style normal/safe typed programming formalism, RS1, that expresses feasible structural recursions and corecursions over data and codata specified by polynomial functors. (Lists, streams, finite trees, infinite trees, etc. are all directly definable.) A novel aspect of RS1 is that it embraces structure-sharing as in standard functional-programming implementations. As our data representations use sharing, our implementation of structural recursions are memoized t"},"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":"1201.4567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-01-22T16:06:01Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"943a773b3fdc952e1f22d7fcb9aba55e367bd1bee54e28b8cf7b2bb35dfaaf34","abstract_canon_sha256":"93561b502541365d3b629b945ef11045a223ae916288925cc72b0f67edad1c1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:42.509891Z","signature_b64":"/QZPMa/6nHmWpiELxKPlFnMexYz+Wv/Ks7cyKxY8A8w3KGh7LL1f7wFswC8n3sx4bXQyBfDOPq3f0J2nV97FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c75ae1061622556a9a5b2eeb5eefcb0fa765ff558ab2136f0236c4207a2aee","last_reissued_at":"2026-05-18T04:03:42.509277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:42.509277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramified Structural Recursion and Corecursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"James S. Royer, Norman Danner","submitted_at":"2012-01-22T16:06:01Z","abstract_excerpt":"We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni-Cook-style normal/safe typed programming formalism, RS1, that expresses feasible structural recursions and corecursions over data and codata specified by polynomial functors. (Lists, streams, finite trees, infinite trees, etc. are all directly definable.) A novel aspect of RS1 is that it embraces structure-sharing as in standard functional-programming implementations. As our data representations use sharing, our implementation of structural recursions are memoized t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4567","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":"1201.4567","created_at":"2026-05-18T04:03:42.509372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4567v2","created_at":"2026-05-18T04:03:42.509372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4567","created_at":"2026-05-18T04:03:42.509372+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULDVVYIGCYRF","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULDVVYIGCYRFK2U2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULDVVYIG","created_at":"2026-05-18T12:27:23.164592+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/ULDVVYIGCYRFK2U2LMXOWXXPZM","json":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM.json","graph_json":"https://pith.science/api/pith-number/ULDVVYIGCYRFK2U2LMXOWXXPZM/graph.json","events_json":"https://pith.science/api/pith-number/ULDVVYIGCYRFK2U2LMXOWXXPZM/events.json","paper":"https://pith.science/paper/ULDVVYIG"},"agent_actions":{"view_html":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM","download_json":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM.json","view_paper":"https://pith.science/paper/ULDVVYIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4567&json=true","fetch_graph":"https://pith.science/api/pith-number/ULDVVYIGCYRFK2U2LMXOWXXPZM/graph.json","fetch_events":"https://pith.science/api/pith-number/ULDVVYIGCYRFK2U2LMXOWXXPZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM/action/storage_attestation","attest_author":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM/action/author_attestation","sign_citation":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM/action/citation_signature","submit_replication":"https://pith.science/pith/ULDVVYIGCYRFK2U2LMXOWXXPZM/action/replication_record"}},"created_at":"2026-05-18T04:03:42.509372+00:00","updated_at":"2026-05-18T04:03:42.509372+00:00"}