{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2VITCXS2PYC6GWGWZDFDID52VK","short_pith_number":"pith:2VITCXS2","schema_version":"1.0","canonical_sha256":"d551315e5a7e05e358d6c8ca340fbaaabf5b48bf73ada7fbc64a513d2964cfbf","source":{"kind":"arxiv","id":"1703.09907","version":1},"attestation_state":"computed","paper":{"title":"A modal typing system for self-referential programs and specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hiroshi Nakano","submitted_at":"2017-03-29T07:03:52Z","abstract_excerpt":"This paper proposes a modal typing system that enables us to handle self-referential formulae, including ones with negative self-references, which on one hand, would introduce a logical contradiction, namely Russell's paradox, in the conventional setting, while on the other hand, are necessary to capture a certain class of programs such as fixed-point combinators and objects with so-called binary methods in object-oriented programming. The proposed system provides a basis for axiomatic semantics of such a wider range of programs and a new framework for natural construction of recursive program"},"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":"1703.09907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-29T07:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"5b1bd78c26b804bb364c9a94ab536708cd886fc729408cf68a1ced56ac276e3c","abstract_canon_sha256":"29d7f5c3523e7c8975961239b5391ab25cae64a9b076c1a22dd94f24a5b51fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:39.063959Z","signature_b64":"JSPIMh1Gr+KxawmthVnd8bhlRYdAdyhWseU0T3zxnt8qKc7O0n4/JmT8yiHX2P+pZXD047E3y7HMAG4Kq33hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d551315e5a7e05e358d6c8ca340fbaaabf5b48bf73ada7fbc64a513d2964cfbf","last_reissued_at":"2026-05-18T00:47:39.063413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:39.063413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A modal typing system for self-referential programs and specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hiroshi Nakano","submitted_at":"2017-03-29T07:03:52Z","abstract_excerpt":"This paper proposes a modal typing system that enables us to handle self-referential formulae, including ones with negative self-references, which on one hand, would introduce a logical contradiction, namely Russell's paradox, in the conventional setting, while on the other hand, are necessary to capture a certain class of programs such as fixed-point combinators and objects with so-called binary methods in object-oriented programming. The proposed system provides a basis for axiomatic semantics of such a wider range of programs and a new framework for natural construction of recursive program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09907","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":"1703.09907","created_at":"2026-05-18T00:47:39.063503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09907v1","created_at":"2026-05-18T00:47:39.063503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09907","created_at":"2026-05-18T00:47:39.063503+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VITCXS2PYC6","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VITCXS2PYC6GWGW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VITCXS2","created_at":"2026-05-18T12:30:55.937587+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/2VITCXS2PYC6GWGWZDFDID52VK","json":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK.json","graph_json":"https://pith.science/api/pith-number/2VITCXS2PYC6GWGWZDFDID52VK/graph.json","events_json":"https://pith.science/api/pith-number/2VITCXS2PYC6GWGWZDFDID52VK/events.json","paper":"https://pith.science/paper/2VITCXS2"},"agent_actions":{"view_html":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK","download_json":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK.json","view_paper":"https://pith.science/paper/2VITCXS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09907&json=true","fetch_graph":"https://pith.science/api/pith-number/2VITCXS2PYC6GWGWZDFDID52VK/graph.json","fetch_events":"https://pith.science/api/pith-number/2VITCXS2PYC6GWGWZDFDID52VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK/action/storage_attestation","attest_author":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK/action/author_attestation","sign_citation":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK/action/citation_signature","submit_replication":"https://pith.science/pith/2VITCXS2PYC6GWGWZDFDID52VK/action/replication_record"}},"created_at":"2026-05-18T00:47:39.063503+00:00","updated_at":"2026-05-18T00:47:39.063503+00:00"}