{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EP6Y3UBF3JIJ3PAGBKOBTW2JM5","short_pith_number":"pith:EP6Y3UBF","schema_version":"1.0","canonical_sha256":"23fd8dd025da509dbc060a9c19db496776f62d8b4a64fe4e4d71837d4060bc59","source":{"kind":"arxiv","id":"1310.1622","version":2},"attestation_state":"computed","paper":{"title":"Non-idempotent intersection types and strong normalisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexis Bernadet (\\'Ecole Polytechnique, \\'Ecole polytechnique, France), St\\'ephane Jean Lengrand (CNRS","submitted_at":"2013-10-06T19:39:09Z","abstract_excerpt":"We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\\lambda}-calculus, the calculus with explicit substitutions {\\lambda}S, and the calculus with explicit substitutions, contractions and weakenings {\\lambda}lxr. In each of the three calculi, a term is typable if and only if it is strongly normalising, as it is the case in (many) systems with idempotent intersections. Non-idempotency brings extra information into typing trees, such as simple bounds on the longest reduction sequence reducing a term to its normal form"},"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":"1310.1622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-06T19:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"26da7877d7270a97298df2fd5bf494b6532c963f3f31228abb5bf558617092be","abstract_canon_sha256":"3175d7ff8477feb4e3d6c12ac5fcf29ea24f6ef6072db16c87bc894f9e47a5ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:37.771261Z","signature_b64":"2EhJ5IdOoFwpCFxgh0nRla5soKmU1EzgBULGi/OFUVKvYKD4mBbowEkpTQ+601pn5v09o+wh+oyjmIepQC4uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23fd8dd025da509dbc060a9c19db496776f62d8b4a64fe4e4d71837d4060bc59","last_reissued_at":"2026-05-18T01:37:37.770759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:37.770759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-idempotent intersection types and strong normalisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexis Bernadet (\\'Ecole Polytechnique, \\'Ecole polytechnique, France), St\\'ephane Jean Lengrand (CNRS","submitted_at":"2013-10-06T19:39:09Z","abstract_excerpt":"We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\\lambda}-calculus, the calculus with explicit substitutions {\\lambda}S, and the calculus with explicit substitutions, contractions and weakenings {\\lambda}lxr. In each of the three calculi, a term is typable if and only if it is strongly normalising, as it is the case in (many) systems with idempotent intersections. Non-idempotency brings extra information into typing trees, such as simple bounds on the longest reduction sequence reducing a term to its normal form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1622","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":"1310.1622","created_at":"2026-05-18T01:37:37.770838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1622v2","created_at":"2026-05-18T01:37:37.770838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1622","created_at":"2026-05-18T01:37:37.770838+00:00"},{"alias_kind":"pith_short_12","alias_value":"EP6Y3UBF3JIJ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EP6Y3UBF3JIJ3PAG","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EP6Y3UBF","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08820","citing_title":"Factoring Derivation Spaces via Intersection Types (Extended Version)","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5","json":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5.json","graph_json":"https://pith.science/api/pith-number/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/graph.json","events_json":"https://pith.science/api/pith-number/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/events.json","paper":"https://pith.science/paper/EP6Y3UBF"},"agent_actions":{"view_html":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5","download_json":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5.json","view_paper":"https://pith.science/paper/EP6Y3UBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1622&json=true","fetch_graph":"https://pith.science/api/pith-number/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/graph.json","fetch_events":"https://pith.science/api/pith-number/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/action/storage_attestation","attest_author":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/action/author_attestation","sign_citation":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/action/citation_signature","submit_replication":"https://pith.science/pith/EP6Y3UBF3JIJ3PAGBKOBTW2JM5/action/replication_record"}},"created_at":"2026-05-18T01:37:37.770838+00:00","updated_at":"2026-05-18T01:37:37.770838+00:00"}