20.500.12556/DiRROS-27768 Simplifying explicit subtyping coercions in a polymorphic calculus with effects Algebraic effect handlers are becoming an increasingly popular way of structuring effectful computations, and their performance is often a concern. One of the proposed approaches towards efficient compilation is tracking effect information through explicit subtyping coercions. However, in the presence of polymorphism, these coercions are compiled into additional arguments of compiled functions, incurring significant overhead. In this paper, we present a polymorphic effectful calculus, identify simplification phases needed to reduce the number of unnecessary constraints, and prove that they preserve semantics. In addition, we implement the simplification algorithm in the Eff language and evaluate its performance on a number of benchmarks. Though we do not prove the optimality of the presented simplifications, the results show that the algorithm eliminates all coercions, resulting in code as efficient as manually monomorphised one. computational effects optimizing compilation algebraic effects polymorphic compilation subtyping denotational semantics true false true Angleški jezik Ni določen Neznano 2026-02-24 13:20:05 2026-02-24 13:20:05 2026-02-25 03:50:48 0000-00-00 00:00:00 2025 0 0 str. 25:1-25:40 iss. 4, article no. 25 Vol. 21 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-01-01 004.43:510.6 1860-5974 10.46298/lmcs-21(4:25)2025 269472003 2404.04218.pdf 2404.04218.pdf 1 346ED72C20699A7B3F2E936027132DB1 23ef99b36425cd2a4a79e7c1b87e5613c8f47de57bd67003623c34aa9b7319cc d1ec14ed-117b-11f1-9cb0-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=40815 https://lmcs.episciences.org/17009 1 27fa374c-117b-11f1-9cb0-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=40812 Inštitut za matematiko, fiziko in mehaniko 0 0 0