Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.05739 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918191951773696 |
|---|---|
| author | Yang, Zhixuan Wu, Nicolas |
| author_facet | Yang, Zhixuan Wu, Nicolas |
| contents | This paper studies the design of programming languages with handlers of higher-order effectful operations -- effectful operations that may take in computations as arguments or return computations as output. We present and analyse a core calculus with higher-kinded impredicative polymorphism, handlers of higher-order effectful operations, and optionally general recursion. The distinctive design choice of this calculus is that handlers are carried by lawless raw monads, while the computation judgements still satisfy the monadic laws judgementally. We present the calculus with a logical framework and give denotational models of the calculus using realizability semantics. We prove closed-term canonicity and parametricity for the recursion-free fragment of the language using synthetic Tait computability and a novel form of the $\top\top$-lifting technique. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_05739 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Handling Higher-Order Effectful Operations with Judgemental Monadic Laws Yang, Zhixuan Wu, Nicolas Programming Languages This paper studies the design of programming languages with handlers of higher-order effectful operations -- effectful operations that may take in computations as arguments or return computations as output. We present and analyse a core calculus with higher-kinded impredicative polymorphism, handlers of higher-order effectful operations, and optionally general recursion. The distinctive design choice of this calculus is that handlers are carried by lawless raw monads, while the computation judgements still satisfy the monadic laws judgementally. We present the calculus with a logical framework and give denotational models of the calculus using realizability semantics. We prove closed-term canonicity and parametricity for the recursion-free fragment of the language using synthetic Tait computability and a novel form of the $\top\top$-lifting technique. |
| title | Handling Higher-Order Effectful Operations with Judgemental Monadic Laws |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2511.05739 |