{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6ZBBYL5TXV3KZHED4UEPEFYPBM","short_pith_number":"pith:6ZBBYL5T","schema_version":"1.0","canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","source":{"kind":"arxiv","id":"1501.02925","version":2},"attestation_state":"computed","paper":{"title":"Programming and Reasoning with Guarded Recursion for Coinductive Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ale\\v{s} Bizjak, Hans Bugge Grathwohl, Lars Birkedal, Ranald Clouston","submitted_at":"2015-01-13T09:24:28Z","abstract_excerpt":"We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions. We give a call-by-name operational semantics for the calculus, and define adequate denotational semantics in the topos of trees. The adequacy proof entails that the evaluation of a program alw"},"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":"1501.02925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-13T09:24:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"bff14a4b31a66637d4553b9613ff7d9a2f4df78795c75cb4ecef09550f8c0764","abstract_canon_sha256":"465c83bd25dcb4ea3e2ff5384c0eefab41e8e693a1012314025eda1a0d129216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:22.926223Z","signature_b64":"haWvOjURk8eY2IXF+/bzKvi0FybbCFW4zbtu2TC/cFc0/2C3CmH3ht4un7kb2q0QfZ37dIcz2nKyWFod7wppDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","last_reissued_at":"2026-05-18T02:29:22.925718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:22.925718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Programming and Reasoning with Guarded Recursion for Coinductive Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ale\\v{s} Bizjak, Hans Bugge Grathwohl, Lars Birkedal, Ranald Clouston","submitted_at":"2015-01-13T09:24:28Z","abstract_excerpt":"We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions. We give a call-by-name operational semantics for the calculus, and define adequate denotational semantics in the topos of trees. The adequacy proof entails that the evaluation of a program alw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02925","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":"1501.02925","created_at":"2026-05-18T02:29:22.925794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02925v2","created_at":"2026-05-18T02:29:22.925794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02925","created_at":"2026-05-18T02:29:22.925794+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZBBYL5TXV3K","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZBBYL5TXV3KZHED","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZBBYL5T","created_at":"2026-05-18T12:29:07.941421+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/6ZBBYL5TXV3KZHED4UEPEFYPBM","json":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM.json","graph_json":"https://pith.science/api/pith-number/6ZBBYL5TXV3KZHED4UEPEFYPBM/graph.json","events_json":"https://pith.science/api/pith-number/6ZBBYL5TXV3KZHED4UEPEFYPBM/events.json","paper":"https://pith.science/paper/6ZBBYL5T"},"agent_actions":{"view_html":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM","download_json":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM.json","view_paper":"https://pith.science/paper/6ZBBYL5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02925&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZBBYL5TXV3KZHED4UEPEFYPBM/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZBBYL5TXV3KZHED4UEPEFYPBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/action/storage_attestation","attest_author":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/action/author_attestation","sign_citation":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/action/citation_signature","submit_replication":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/action/replication_record"}},"created_at":"2026-05-18T02:29:22.925794+00:00","updated_at":"2026-05-18T02:29:22.925794+00:00"}