Exploring unified semantics for functional programming and CRDTs: domain-theoretic programming and semilattice homomorphisms
jessi_cata · x · 2026-08-14
A technical discussion: envisioning a functional programming language that unifies Haskell-like domain-theoretic programming and CRDT-like semilattices and homomorphisms in a unified semantics. For semilattices, we get product ADTs but not coproduct ADTs. A reply explains: Scott domains need not be semilattices; to generalize semilattice homomorphisms to Scott domains, we use linear Scott-continuous maps that preserve finite joins when they exist, and more general Scott-continuous maps can be retrieved using linear logic constructions.
More from Research
- UIUC Introduces LLMRouter: Unified Infrastructure and Benchmark for LLM Routing — UIUC-CS · 2026-08-14
- Shanghai AI Lab Releases H2R-Bench: Evaluating Human-to-Robot Video Generation — Shanghai-AI-Laboratory · 2026-08-14
- Alibaba Releases DreamX-Phi 1.0: Action-Conditioned Video World Model for Robotics — alibabagroup · 2026-08-14
- DLA by ByteDance & Universities Tackles Long-Context Costs with Dynamic Linear Attention — burkov · 2026-08-14
- Vista4D: Video Reshooting with 4D Point Clouds, CVPR 2026 Highlight — rsasaki0109 · 2026-08-14
- SIGCHI Announces Futures Summit in Paris, November 2026, to Reflect on Long-Term Future — plopesresearch · 2026-08-14