{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NETEMVNWMNNSOZEMGUI5RSP7UI","short_pith_number":"pith:NETEMVNW","schema_version":"1.0","canonical_sha256":"69264655b6635b27648c3511d8c9ffa2156caf13cb52705f45289a2fcce7532c","source":{"kind":"arxiv","id":"1508.00455","version":1},"attestation_state":"computed","paper":{"title":"Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Cyprien Mangin (Univ Paris Diderot & \\'Ecole Polytechnique), Matthieu Sozeau (Inria Paris & PPS, Univ Paris Diderot)","submitted_at":"2015-07-29T08:21:28Z","abstract_excerpt":"This paper presents a case study of formalizing a normalization proof for Leivant's Predicative System F using the Equations package. Leivant's Predicative System F is a stratified version of System F, where type quantification is annotated with kinds representing universe levels. A weaker variant of this system was studied by Stump & Eades, employing the hereditary substitution method to show normalization. We improve on this result by showing normalization for Leivant's original system using hereditary substitutions and a novel multiset ordering on types. Our development is done in the Coq p"},"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":"1508.00455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-29T08:21:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"1358f4c7c00fd01eb08cea08f96e67923abbae915a968d84d0ecfc446c49a376","abstract_canon_sha256":"8adce622db14dd218b58def21c666be8243836b4ca5440f1ef9d8760f1ced653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:58.088832Z","signature_b64":"qup1YERn+5Pyh2MgU5s27wKDXIhvHlICgFyFIEGsbMaEmCob1dWMcznWpJol3X7W89Tr8n5L8dSVwxnGZEtjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69264655b6635b27648c3511d8c9ffa2156caf13cb52705f45289a2fcce7532c","last_reissued_at":"2026-05-18T01:35:58.088333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:58.088333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Cyprien Mangin (Univ Paris Diderot & \\'Ecole Polytechnique), Matthieu Sozeau (Inria Paris & PPS, Univ Paris Diderot)","submitted_at":"2015-07-29T08:21:28Z","abstract_excerpt":"This paper presents a case study of formalizing a normalization proof for Leivant's Predicative System F using the Equations package. Leivant's Predicative System F is a stratified version of System F, where type quantification is annotated with kinds representing universe levels. A weaker variant of this system was studied by Stump & Eades, employing the hereditary substitution method to show normalization. We improve on this result by showing normalization for Leivant's original system using hereditary substitutions and a novel multiset ordering on types. Our development is done in the Coq p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00455","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":"1508.00455","created_at":"2026-05-18T01:35:58.088418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00455v1","created_at":"2026-05-18T01:35:58.088418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00455","created_at":"2026-05-18T01:35:58.088418+00:00"},{"alias_kind":"pith_short_12","alias_value":"NETEMVNWMNNS","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NETEMVNWMNNSOZEM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NETEMVNW","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.18921","citing_title":"Constructing (Co)inductive Types via Large Sizes","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI","json":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI.json","graph_json":"https://pith.science/api/pith-number/NETEMVNWMNNSOZEMGUI5RSP7UI/graph.json","events_json":"https://pith.science/api/pith-number/NETEMVNWMNNSOZEMGUI5RSP7UI/events.json","paper":"https://pith.science/paper/NETEMVNW"},"agent_actions":{"view_html":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI","download_json":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI.json","view_paper":"https://pith.science/paper/NETEMVNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00455&json=true","fetch_graph":"https://pith.science/api/pith-number/NETEMVNWMNNSOZEMGUI5RSP7UI/graph.json","fetch_events":"https://pith.science/api/pith-number/NETEMVNWMNNSOZEMGUI5RSP7UI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI/action/storage_attestation","attest_author":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI/action/author_attestation","sign_citation":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI/action/citation_signature","submit_replication":"https://pith.science/pith/NETEMVNWMNNSOZEMGUI5RSP7UI/action/replication_record"}},"created_at":"2026-05-18T01:35:58.088418+00:00","updated_at":"2026-05-18T01:35:58.088418+00:00"}