{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LCRS3CQ4DCK3RN46GM2VTYRVRR","short_pith_number":"pith:LCRS3CQ4","schema_version":"1.0","canonical_sha256":"58a32d8a1c1895b8b79e333559e2358c78c1e13df76b809de97100b4a106ead3","source":{"kind":"arxiv","id":"1802.10583","version":1},"attestation_state":"computed","paper":{"title":"Reducing Lambda Terms with Traversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"William Blum","submitted_at":"2018-02-28T18:46:19Z","abstract_excerpt":"We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus.\n  The traversal theory of the simply-typed lambda calculus relies on the eta-long transform to ensure that when traversing an application, there is a subterm representing every possible operator's argument. In the untyped setting, we instead exhibit the missing operand via ad-hoc instantiation of the eta-expansion rule, which allows the traversal to proceed as if the ope"},"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":"1802.10583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-28T18:46:19Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"30c773537f6745e72a7a37babed7a9acc025943b14a9a217ee110087eaf0a7f8","abstract_canon_sha256":"473485223f7fa6c47901b6be96ab3e8dc1a68caaafb87864457c56ea4d1ddd41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.722065Z","signature_b64":"kvpkz8nfqG4mVD/p8rIllgvytO+o7MwP17He+WXjYskaQ2t0JEQG8MjAjSVro85rVR/azYqKe6vvHJebXulKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a32d8a1c1895b8b79e333559e2358c78c1e13df76b809de97100b4a106ead3","last_reissued_at":"2026-05-18T00:22:16.721408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.721408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Lambda Terms with Traversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"William Blum","submitted_at":"2018-02-28T18:46:19Z","abstract_excerpt":"We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus.\n  The traversal theory of the simply-typed lambda calculus relies on the eta-long transform to ensure that when traversing an application, there is a subterm representing every possible operator's argument. In the untyped setting, we instead exhibit the missing operand via ad-hoc instantiation of the eta-expansion rule, which allows the traversal to proceed as if the ope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10583","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":"1802.10583","created_at":"2026-05-18T00:22:16.721524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10583v1","created_at":"2026-05-18T00:22:16.721524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10583","created_at":"2026-05-18T00:22:16.721524+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCRS3CQ4DCK3","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCRS3CQ4DCK3RN46","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCRS3CQ4","created_at":"2026-05-18T12:32:33.847187+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/LCRS3CQ4DCK3RN46GM2VTYRVRR","json":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR.json","graph_json":"https://pith.science/api/pith-number/LCRS3CQ4DCK3RN46GM2VTYRVRR/graph.json","events_json":"https://pith.science/api/pith-number/LCRS3CQ4DCK3RN46GM2VTYRVRR/events.json","paper":"https://pith.science/paper/LCRS3CQ4"},"agent_actions":{"view_html":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR","download_json":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR.json","view_paper":"https://pith.science/paper/LCRS3CQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10583&json=true","fetch_graph":"https://pith.science/api/pith-number/LCRS3CQ4DCK3RN46GM2VTYRVRR/graph.json","fetch_events":"https://pith.science/api/pith-number/LCRS3CQ4DCK3RN46GM2VTYRVRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR/action/storage_attestation","attest_author":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR/action/author_attestation","sign_citation":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR/action/citation_signature","submit_replication":"https://pith.science/pith/LCRS3CQ4DCK3RN46GM2VTYRVRR/action/replication_record"}},"created_at":"2026-05-18T00:22:16.721524+00:00","updated_at":"2026-05-18T00:22:16.721524+00:00"}