{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZSTLENPP7R3T5E5J6FNP3J6PQA","short_pith_number":"pith:ZSTLENPP","canonical_record":{"source":{"id":"1908.03619","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-09T20:38:05Z","cross_cats_sorted":[],"title_canon_sha256":"0fefd2e2a95cbf2ab7a45066078cb8f3df2c00df8c7d4298861cd6c0d28e62cc","abstract_canon_sha256":"6e347db7e4ece20ef1c3f5f9efe60ec6443260fbed340ca9ea7c9d992ea94180"},"schema_version":"1.0"},"canonical_sha256":"cca6b235effc773e93a9f15afda7cf8021badcd3a2a8d66738bf814bd1f5b144","source":{"kind":"arxiv","id":"1908.03619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03619","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03619v1","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03619","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZSTLENPP7R3T","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZSTLENPP7R3T5E5J","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZSTLENPP","created_at":"2026-07-04T23:52:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZSTLENPP7R3T5E5J6FNP3J6PQA","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03619","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-09T20:38:05Z","cross_cats_sorted":[],"title_canon_sha256":"0fefd2e2a95cbf2ab7a45066078cb8f3df2c00df8c7d4298861cd6c0d28e62cc","abstract_canon_sha256":"6e347db7e4ece20ef1c3f5f9efe60ec6443260fbed340ca9ea7c9d992ea94180"},"schema_version":"1.0"},"canonical_sha256":"cca6b235effc773e93a9f15afda7cf8021badcd3a2a8d66738bf814bd1f5b144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:42.841010Z","signature_b64":"pxTaVv+7ZpOliZltxtPIWjpiLfOxtcnZGFCRvPjPtqbTX5H7BcwHnrRHlMX0yBW1g04UcEuSqXlL02OO0uufCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca6b235effc773e93a9f15afda7cf8021badcd3a2a8d66738bf814bd1f5b144","last_reissued_at":"2026-07-04T23:52:42.840585Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:42.840585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03619","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aC+Z1r0KeObqWIzYd6i6YJ92G1LhqumRkSySan2O5euebhIqTVZromiHNYqqmsywFRDdiI7RMs0mdkM7Z/lyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:46:55.869784Z"},"content_sha256":"8d172b9b9857942d6030512080e3187c7057b5ffdb14697fb6c6178bdbc8affc","schema_version":"1.0","event_id":"sha256:8d172b9b9857942d6030512080e3187c7057b5ffdb14697fb6c6178bdbc8affc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZSTLENPP7R3T5E5J6FNP3J6PQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Functional programming with lambda-tree syntax","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Dale Miller, Gabriel Scherer, Ulysse G\\'erard","submitted_at":"2019-08-09T20:38:05Z","abstract_excerpt":"We present the design of a new functional programming language, MLTS, that uses the lambda-tree syntax approach to encoding bindings appearing within data structures. In this approach, bindings never become free nor escape their scope: instead, binders in data structures are permitted to move to binders within programs. The design of MLTS includes additional sites within programs that directly support this movement of bindings. In order to formally define the language's operational semantics, we present an abstract syntax for MLTS and a natural semantics for its evaluation. We shall view such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03619","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03619/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZ8wMQFou5mcJ18jvbxq3sCTDp6sEnT4dbBRd0w9yljwrMkBYFVb4lgIA4+yQp1u/ywoy3Ou4it/1KJwSFKsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:46:55.870276Z"},"content_sha256":"fb8a0fe451aa5a337f0e3edab4c1e8dcc1b07f9b4b9d875622f727cdd3bb630c","schema_version":"1.0","event_id":"sha256:fb8a0fe451aa5a337f0e3edab4c1e8dcc1b07f9b4b9d875622f727cdd3bb630c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA/bundle.json","state_url":"https://pith.science/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T11:46:55Z","links":{"resolver":"https://pith.science/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA","bundle":"https://pith.science/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA/bundle.json","state":"https://pith.science/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSTLENPP7R3T5E5J6FNP3J6PQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZSTLENPP7R3T5E5J6FNP3J6PQA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e347db7e4ece20ef1c3f5f9efe60ec6443260fbed340ca9ea7c9d992ea94180","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-09T20:38:05Z","title_canon_sha256":"0fefd2e2a95cbf2ab7a45066078cb8f3df2c00df8c7d4298861cd6c0d28e62cc"},"schema_version":"1.0","source":{"id":"1908.03619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03619","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03619v1","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03619","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZSTLENPP7R3T","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZSTLENPP7R3T5E5J","created_at":"2026-07-04T23:52:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZSTLENPP","created_at":"2026-07-04T23:52:42Z"}],"graph_snapshots":[{"event_id":"sha256:fb8a0fe451aa5a337f0e3edab4c1e8dcc1b07f9b4b9d875622f727cdd3bb630c","target":"graph","created_at":"2026-07-04T23:52:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03619/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the design of a new functional programming language, MLTS, that uses the lambda-tree syntax approach to encoding bindings appearing within data structures. In this approach, bindings never become free nor escape their scope: instead, binders in data structures are permitted to move to binders within programs. The design of MLTS includes additional sites within programs that directly support this movement of bindings. In order to formally define the language's operational semantics, we present an abstract syntax for MLTS and a natural semantics for its evaluation. We shall view such ","authors_text":"Dale Miller, Gabriel Scherer, Ulysse G\\'erard","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03619","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8d172b9b9857942d6030512080e3187c7057b5ffdb14697fb6c6178bdbc8affc","target":"record","created_at":"2026-07-04T23:52:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e347db7e4ece20ef1c3f5f9efe60ec6443260fbed340ca9ea7c9d992ea94180","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-09T20:38:05Z","title_canon_sha256":"0fefd2e2a95cbf2ab7a45066078cb8f3df2c00df8c7d4298861cd6c0d28e62cc"},"schema_version":"1.0","source":{"id":"1908.03619","kind":"arxiv","version":1}},"canonical_sha256":"cca6b235effc773e93a9f15afda7cf8021badcd3a2a8d66738bf814bd1f5b144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cca6b235effc773e93a9f15afda7cf8021badcd3a2a8d66738bf814bd1f5b144","first_computed_at":"2026-07-04T23:52:42.840585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:42.840585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pxTaVv+7ZpOliZltxtPIWjpiLfOxtcnZGFCRvPjPtqbTX5H7BcwHnrRHlMX0yBW1g04UcEuSqXlL02OO0uufCg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:42.841010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d172b9b9857942d6030512080e3187c7057b5ffdb14697fb6c6178bdbc8affc","sha256:fb8a0fe451aa5a337f0e3edab4c1e8dcc1b07f9b4b9d875622f727cdd3bb630c"],"state_sha256":"b7b58268db97812dbc4433cb700622fbdae7da8b5186b8a4b4a343a1c3845792"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ec3pDptYX4Rc3oFMWPhx5e8wcutVFXQNbJx4KwGeM3wbpthVtXqj5e0TqPLUl720hRJKUu00cK2cnMMK4Ez4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:46:55.875237Z","bundle_sha256":"ef7738c6cbbc08f829df65d1378efdb6c8441b3c63b034919dfec008afe58b17"}}