Functional pearl

Oleg Kiselyov, Chung-chieh Shan
2004 Proceedings of the ACM SIGPLAN workshop on Haskell - Haskell '04  
The configurations problem is to propagate run-time preferences throughout a program, allowing multiple concurrent configuration sets to coexist safely under statically guaranteed separation. This problem is common in all software systems, but particularly acute in Haskell, where currently the most popular solution relies on unsafe operations and compiler pragmas. We solve the configurations problem in Haskell using only stable and widely implemented language features like the type-class
more » ... In our approach, a term expression can refer to run-time configuration parameters as if they were compile-time constants in global scope. Besides supporting such intuitive term notation and statically guaranteeing separation, our solution also helps improve the program's performance by transparently dispatching to specialized code at run-time. We can propagate any type of configuration data-numbers, strings, IO actions, polymorphic functions, closures, and abstract data types. No previous approach to propagating configurations implicitly in any language provides the same static separation guarantees. The enabling technique behind our solution is to propagate values via types, with the help of polymorphic recursion and higherrank polymorphism. The technique essentially emulates local typeclass instance declarations while preserving coherence. Configuration parameters are propagated throughout the code implicitly as part of type inference rather than explicitly by the programmer. Our technique can be regarded as a portable, coherent, and intuitive alternative to implicit parameters. It motivates adding local instances to Haskell, with a restriction that salvages principal types.
doi:10.1145/1017472.1017481 dblp:conf/haskell/KiselyovS04 fatcat:yhkn7vg2vzfxrh7ttcvkiy5kzy