{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LLY4YGHEXO5OWEQJG7WVI3FU7S","short_pith_number":"pith:LLY4YGHE","schema_version":"1.0","canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","source":{"kind":"arxiv","id":"1907.03631","version":1},"attestation_state":"computed","paper":{"title":"$\\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Federico Aschieri, Francesco A. Genco","submitted_at":"2019-07-08T14:08:53Z","abstract_excerpt":"Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deduction system and show it is isomorphic to a simple and natural extension of $\\lambda$-calculus with parallelism and communication primitives, called $\\lambda_{\\unicode{8523}}$. We shall prove that $\\lambda_{\\unicode{8523}}$ satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and con"},"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":"1907.03631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-08T14:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"6b5f1cf1d1810e319df68f2ecb2cb7525eacb60fcd6c355942057efa4bd85878","abstract_canon_sha256":"67b77899d02be01e21ad47e5d81269c33c57b8cb69d604396cb077039c811521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:14.135483Z","signature_b64":"gKXbt2PAX07+p7vvBFQzlP9+8ioOm9vIrtinPr2+oX9G5TRGwb4Gm4MCofc0RUr8qpSqpMvd70sowwM/uSP6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5af1cc18e4bbbaeb120937ed546cb4fcb672db15a8b8ee847635aa5d8859fb27","last_reissued_at":"2026-05-17T23:41:14.135025Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:14.135025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Federico Aschieri, Francesco A. Genco","submitted_at":"2019-07-08T14:08:53Z","abstract_excerpt":"Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deduction system and show it is isomorphic to a simple and natural extension of $\\lambda$-calculus with parallelism and communication primitives, called $\\lambda_{\\unicode{8523}}$. We shall prove that $\\lambda_{\\unicode{8523}}$ satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03631","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":"1907.03631","created_at":"2026-05-17T23:41:14.135123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03631v1","created_at":"2026-05-17T23:41:14.135123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03631","created_at":"2026-05-17T23:41:14.135123+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLY4YGHEXO5O","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLY4YGHEXO5OWEQJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLY4YGHE","created_at":"2026-05-18T12:33:21.387695+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/LLY4YGHEXO5OWEQJG7WVI3FU7S","json":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S.json","graph_json":"https://pith.science/api/pith-number/LLY4YGHEXO5OWEQJG7WVI3FU7S/graph.json","events_json":"https://pith.science/api/pith-number/LLY4YGHEXO5OWEQJG7WVI3FU7S/events.json","paper":"https://pith.science/paper/LLY4YGHE"},"agent_actions":{"view_html":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S","download_json":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S.json","view_paper":"https://pith.science/paper/LLY4YGHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03631&json=true","fetch_graph":"https://pith.science/api/pith-number/LLY4YGHEXO5OWEQJG7WVI3FU7S/graph.json","fetch_events":"https://pith.science/api/pith-number/LLY4YGHEXO5OWEQJG7WVI3FU7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/action/storage_attestation","attest_author":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/action/author_attestation","sign_citation":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/action/citation_signature","submit_replication":"https://pith.science/pith/LLY4YGHEXO5OWEQJG7WVI3FU7S/action/replication_record"}},"created_at":"2026-05-17T23:41:14.135123+00:00","updated_at":"2026-05-17T23:41:14.135123+00:00"}