{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N7D343XRHCVV2COO73QH2RXYNS","short_pith_number":"pith:N7D343XR","schema_version":"1.0","canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","source":{"kind":"arxiv","id":"1705.08632","version":2},"attestation_state":"computed","paper":{"title":"Faithful (meta-)encodings of programmable strategies into term rewriting systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Horatiu Cirstea, Pierre-Etienne Moreau, Serguei Lenglet","submitted_at":"2017-05-24T07:06:41Z","abstract_excerpt":"Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con- trol their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term"},"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":"1705.08632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-24T07:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"06aa35cb77b5e7edc6e9c335746fab6ed9158f6e1f49c87f97d299e99b346978","abstract_canon_sha256":"b62404e41d6d01996017f7005d29ed86b327f0a3bdd1ace03431c344436651c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.599964Z","signature_b64":"le9v6B8ZGdGAfLq8jnyNwtTaigGghb3GEIRooTnaINHfCW+uWaKkJbGDWH9WSjkRbM4n3ud3C+IkayjC4xULCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","last_reissued_at":"2026-05-17T23:51:21.599568Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.599568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faithful (meta-)encodings of programmable strategies into term rewriting systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Horatiu Cirstea, Pierre-Etienne Moreau, Serguei Lenglet","submitted_at":"2017-05-24T07:06:41Z","abstract_excerpt":"Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con- trol their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08632","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":"1705.08632","created_at":"2026-05-17T23:51:21.599624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08632v2","created_at":"2026-05-17T23:51:21.599624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08632","created_at":"2026-05-17T23:51:21.599624+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7D343XRHCVV","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7D343XRHCVV2COO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7D343XR","created_at":"2026-05-18T12:31:31.346846+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/N7D343XRHCVV2COO73QH2RXYNS","json":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS.json","graph_json":"https://pith.science/api/pith-number/N7D343XRHCVV2COO73QH2RXYNS/graph.json","events_json":"https://pith.science/api/pith-number/N7D343XRHCVV2COO73QH2RXYNS/events.json","paper":"https://pith.science/paper/N7D343XR"},"agent_actions":{"view_html":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS","download_json":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS.json","view_paper":"https://pith.science/paper/N7D343XR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08632&json=true","fetch_graph":"https://pith.science/api/pith-number/N7D343XRHCVV2COO73QH2RXYNS/graph.json","fetch_events":"https://pith.science/api/pith-number/N7D343XRHCVV2COO73QH2RXYNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/action/storage_attestation","attest_author":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/action/author_attestation","sign_citation":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/action/citation_signature","submit_replication":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/action/replication_record"}},"created_at":"2026-05-17T23:51:21.599624+00:00","updated_at":"2026-05-17T23:51:21.599624+00:00"}