{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MANYBFHO6U3XKCPRLRC7E6K2P3","short_pith_number":"pith:MANYBFHO","schema_version":"1.0","canonical_sha256":"601b8094eef5377509f15c45f2795a7eecb336942f0fe9cab8d6a3c5def226b3","source":{"kind":"arxiv","id":"1209.5851","version":1},"attestation_state":"computed","paper":{"title":"A polynomial time {\\lambda}-calculus with multithreading and side effects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Antoine Madet (PPS)","submitted_at":"2012-09-26T07:33:43Z","abstract_excerpt":"The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of polynomial time. After introducing a modal \\lambda-calculus with parallel composition and regions, we prove that a realistic call-by-value evaluation strategy can be computed in polynomial time for a class of well-formed programs. The result relies on the simulation of call-by-value by a polynomial shallow-first strategy which preserves the evaluation order of side"},"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":"1209.5851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-09-26T07:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"a6306f51d5fe525ca40b9f509ea008d335867b9b1338a333bb51a49cad54b86b","abstract_canon_sha256":"9cbcde8bb4037e66d98609f40a0e9e43296fcbb2e24222498d9453149f5c458e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:46.163028Z","signature_b64":"MlffzG9/0T9DhIFgJtJ200NgHc2A+Tq3QjAon+XQyEwRTZfiZ7h+kp5BsGIZlImeUH2+ZZJmFvqVteZ1qRP+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"601b8094eef5377509f15c45f2795a7eecb336942f0fe9cab8d6a3c5def226b3","last_reissued_at":"2026-05-18T03:44:46.162225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:46.162225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial time {\\lambda}-calculus with multithreading and side effects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Antoine Madet (PPS)","submitted_at":"2012-09-26T07:33:43Z","abstract_excerpt":"The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of polynomial time. After introducing a modal \\lambda-calculus with parallel composition and regions, we prove that a realistic call-by-value evaluation strategy can be computed in polynomial time for a class of well-formed programs. The result relies on the simulation of call-by-value by a polynomial shallow-first strategy which preserves the evaluation order of side"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5851","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":"1209.5851","created_at":"2026-05-18T03:44:46.162376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5851v1","created_at":"2026-05-18T03:44:46.162376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5851","created_at":"2026-05-18T03:44:46.162376+00:00"},{"alias_kind":"pith_short_12","alias_value":"MANYBFHO6U3X","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MANYBFHO6U3XKCPR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MANYBFHO","created_at":"2026-05-18T12:27:14.488303+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/MANYBFHO6U3XKCPRLRC7E6K2P3","json":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3.json","graph_json":"https://pith.science/api/pith-number/MANYBFHO6U3XKCPRLRC7E6K2P3/graph.json","events_json":"https://pith.science/api/pith-number/MANYBFHO6U3XKCPRLRC7E6K2P3/events.json","paper":"https://pith.science/paper/MANYBFHO"},"agent_actions":{"view_html":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3","download_json":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3.json","view_paper":"https://pith.science/paper/MANYBFHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5851&json=true","fetch_graph":"https://pith.science/api/pith-number/MANYBFHO6U3XKCPRLRC7E6K2P3/graph.json","fetch_events":"https://pith.science/api/pith-number/MANYBFHO6U3XKCPRLRC7E6K2P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3/action/storage_attestation","attest_author":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3/action/author_attestation","sign_citation":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3/action/citation_signature","submit_replication":"https://pith.science/pith/MANYBFHO6U3XKCPRLRC7E6K2P3/action/replication_record"}},"created_at":"2026-05-18T03:44:46.162376+00:00","updated_at":"2026-05-18T03:44:46.162376+00:00"}