{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:P6PUVYK3HWMQKQIFZOGCEKKLHR","short_pith_number":"pith:P6PUVYK3","schema_version":"1.0","canonical_sha256":"7f9f4ae15b3d99054105cb8c22294b3c47930066dea36cec31c52dc2465b9bb4","source":{"kind":"arxiv","id":"cs/0507007","version":4},"attestation_state":"computed","paper":{"title":"Strong normalisation for applied lambda calculi","license":"","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ulrich Berger","submitted_at":"2005-07-04T18:49:48Z","abstract_excerpt":"We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations' are. From this we derive a general normalisation theorem for applied typed lambda-calculi: If all constants have a total value, then all typeable terms are strongly normalising. We apply this result to extensions of G\\\"odel's system T and system F extended by various forms of bar recursion for which strong normalisation was hitherto unknown."},"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":"cs/0507007","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.GT","submitted_at":"2005-07-04T18:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"de0aa801dc67656320bdc41bab47925a3ae6d622859a1b1354fc85b95a674c0d","abstract_canon_sha256":"5671ed0af3b836840a2ae181fdf3d7f21bd5d0320403f1a03eb0272db741c767"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.481685Z","signature_b64":"D2BGHlqzVodbyyxNwEfrfndtX0z7jq9Uy/pFVsPgiKOgY8/KHzCIal1obsjBeZK0H6kzY9Qf1SQGl5w6iLdhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9f4ae15b3d99054105cb8c22294b3c47930066dea36cec31c52dc2465b9bb4","last_reissued_at":"2026-05-18T00:53:03.481291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.481291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong normalisation for applied lambda calculi","license":"","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ulrich Berger","submitted_at":"2005-07-04T18:49:48Z","abstract_excerpt":"We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations' are. From this we derive a general normalisation theorem for applied typed lambda-calculi: If all constants have a total value, then all typeable terms are strongly normalising. We apply this result to extensions of G\\\"odel's system T and system F extended by various forms of bar recursion for which strong normalisation was hitherto unknown."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0507007","kind":"arxiv","version":4},"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":"cs/0507007","created_at":"2026-05-18T00:53:03.481360+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0507007v4","created_at":"2026-05-18T00:53:03.481360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0507007","created_at":"2026-05-18T00:53:03.481360+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6PUVYK3HWMQ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6PUVYK3HWMQKQIF","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6PUVYK3","created_at":"2026-05-18T12:25:53.335082+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/P6PUVYK3HWMQKQIFZOGCEKKLHR","json":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR.json","graph_json":"https://pith.science/api/pith-number/P6PUVYK3HWMQKQIFZOGCEKKLHR/graph.json","events_json":"https://pith.science/api/pith-number/P6PUVYK3HWMQKQIFZOGCEKKLHR/events.json","paper":"https://pith.science/paper/P6PUVYK3"},"agent_actions":{"view_html":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR","download_json":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR.json","view_paper":"https://pith.science/paper/P6PUVYK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0507007&json=true","fetch_graph":"https://pith.science/api/pith-number/P6PUVYK3HWMQKQIFZOGCEKKLHR/graph.json","fetch_events":"https://pith.science/api/pith-number/P6PUVYK3HWMQKQIFZOGCEKKLHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR/action/storage_attestation","attest_author":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR/action/author_attestation","sign_citation":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR/action/citation_signature","submit_replication":"https://pith.science/pith/P6PUVYK3HWMQKQIFZOGCEKKLHR/action/replication_record"}},"created_at":"2026-05-18T00:53:03.481360+00:00","updated_at":"2026-05-18T00:53:03.481360+00:00"}