Yes, in a strict language I would view "data Nat = Zero | Succ Nat" as an equation "N ~= 1 + N" in DCPO, giving us just the discrete dcpo Nat. (This is the semantics of _values_ of Nat, so it doesn't need to support recursion. Computations of Nat have semantics F N and admit recurison.)
PS: I increasingly like strict functional languages (say ML or GHC with the Strict extension). Laziness occasionally improves asymptotic complexity but more often slows down the constant factor, and more importantly, making reasoning a lot harder.
Zhixuan Yang
npub1v6…ac7s4
2026-05-16 10:50:03 UTC
in reply to nevent1q…5j3k
Author Public Key
npub1v6afl9hlcsdeqcw06j3lqtv48xjqpmfyp2nc5e6k829vlp5ekg3qjac7s4Seen on
wss://relay.momostr.pinkPublished at
2026-05-16 10:50:03 UTCEvent JSON
{
"id": "07ee82560dffd4f2b4b794f1dc439a7c4ff3c0be12df2f7f74bb837e44578128",
"pubkey": "66ba9f96ffc41b9061cfd4a3f02d9539a400ed240aa78a67563a8acf8699b222",
"created_at": 1778928603,
"kind": 1,
"tags": [
[
"p",
"e613f8d3f4092d399e5125d1704bf2dffe686f6b92116e1921e78ea9cc6993dc"
],
[
"p",
"66ba9f96ffc41b9061cfd4a3f02d9539a400ed240aa78a67563a8acf8699b222"
],
[
"e",
"afb903347d3f7cdbd39a3f7eec523f89acd8f096276f6bfce7c540feb1aafdcf",
"",
"root",
"e613f8d3f4092d399e5125d1704bf2dffe686f6b92116e1921e78ea9cc6993dc"
],
[
"proxy",
"https://mathstodon.xyz/@zyang/116583864926807088",
"web"
],
[
"e",
"8f3ded2c1e0dbeead0eda4d41f0fb86f1c70336d131ce7d0f3ddc99f76ad7e80",
"",
"reply",
"e613f8d3f4092d399e5125d1704bf2dffe686f6b92116e1921e78ea9cc6993dc"
],
[
"proxy",
"https://mathstodon.xyz/users/zyang/statuses/116583864926807088",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://mathstodon.xyz/users/zyang/statuses/116583864926807088",
"pink.momostr"
],
[
"-"
]
],
"content": "Yes, in a strict language I would view \"data Nat = Zero | Succ Nat\" as an equation \"N ~= 1 + N\" in DCPO, giving us just the discrete dcpo Nat. (This is the semantics of _values_ of Nat, so it doesn't need to support recursion. Computations of Nat have semantics F N and admit recurison.)\n\nPS: I increasingly like strict functional languages (say ML or GHC with the Strict extension). Laziness occasionally improves asymptotic complexity but more often slows down the constant factor, and more importantly, making reasoning a lot harder.",
"sig": "08d7a2f81604af43dafba5a4e86da3df4d9491d1b374d5f085b475e0c38b6e5859ce4a8188c93fee046c6ddb0bf244373fc36ab730fd908eb34f3b0d9b979440"
}