Homomorphic static analysis

maralorn: > (I looked into this and my impression is that 2. is only really possible for “Causal Commutative Arrows”, which is quite restrictive.) Yeah, that was basically also the premise of this talk: Haskell 2021 - Evaluating Linear Functions to Symmetric Monoidal Categories However, I don’t understand why you would want this pointfree style and not just use the tried and true approach of (pointful) syntax. You can just define a data type like: data Program = Parallel Program Program | Sequential Program Program | Var String | Lambda String Program | App Program Program | Print String -- ... etc If you want you can even make this intrinsically typed and extensible. Is it just because arrows have some built-in syntax? In that case it sounds simpler to me to extend GHC with more overloaded syntax (like Conal Elliott did with his work on compiling to categories).