Reproduce “Handling Higher-Order Effectful Operations with Judgemental Monadic Laws” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Zhixuan Yang, Nicolas Wu
This research introduces System Fωha, a core programming calculus from Imperial College London, that allows handlers of higher-order effectful operations while preserving essential judgmental monadic laws for computations, even when handlers are implemented using raw monads. The framework achieves this by not requiring handlers to commute with `let-in`, demonstrating consistency, canonicity, and parametricity through realizability semantics and synthetic Tait computability.
Key insights
- Maintaining judgmental monadic laws for computations is achievable even with handlers based on raw monads, provided the `hdl` construct is not assumed to commute with `let-in`.
- A CPS interpretation of computations (`(h : Handler H) → (B : Type) → (A → h B) → h B`) allows the universal quantification over handlers and continuations to ensure `let-in` and `val` behave lawfully within the computation judgment.
- Synthetic Tait Computability (STC) with a novel `⊤⊤-lifting` technique is crucial for proving canonicity of computations in the absence of a `hdl`-`let-in` commutation law.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.