Comodule representations of second-order functionals

• Published in: Journal of logical and algebraic methods in programming Vol. 146; p. 101071
• Main Authors: Ahman, Danel, Bauer, Andrej
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.07.2025
• Subjects: Comodule representations; Comodules; Computational effects; Containers; Instance reductions; Monads; Second-order functionals; Tree representations; Monads; Second-order functionals; Instance reductions; Computational effects; Tree representations; Comodule representations; Containers; Comodules
• DOI: 10.1016/j.jlamp.2025.101071
• ISSN: 2352-2208

We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally subsumes classic representations of continuous functionals with well-founded trees. We find other kinds of representations by varying the monad, the comodule, and in some cases the underlying category of containers. Examples include uniformly continuous or finitely supported functionals, functionals querying their arguments precisely once, or at most once, functionals interacting with an ambient environment through computational effects, as well as functionals trivially representing themselves. Many of these rely on our construction of a monad on containers from a monad on shapes and a weak Mendler-style monad algebra on the universe for positions. We show that comodule representability on the category of propositional containers, which have positions valued in a universe of propositions, is closely related to instance reducibility in constructive mathematics, and through it to Weihrauch reducibility in computability theory.