How to create a polyvariadic haskell function?

by

The key points of printf is the ability to either return a String or a function. Copied from http://www.haskell.org/ghc/docs/6.12.2/html/libraries/base-4.2.0.1/src/Text-Printf.html,

printf :: (PrintfType r) => String -> r
printf fmts = spr fmts []

class PrintfType t where
    spr :: String -> [UPrintf] -> t

instance (IsChar c) => PrintfType [c] where
    spr fmts args = map fromChar (uprintf fmts (reverse args))

instance (PrintfArg a, PrintfType r) => PrintfType (a -> r) where
    spr fmts args = \a -> spr fmts (toUPrintf a : args)

and the basic structure we can extract out is

variadicFunction :: VariadicReturnClass r => RequiredArgs -> r
variadicFunction reqArgs = variadicImpl reqArgs mempty

class VariadicReturnClass r where
   variadicImpl :: RequiredArgs -> AccumulatingType -> r

instance VariadicReturnClass ActualReturnType where
   variadicImpl reqArgs acc = constructActualResult reqArgs acc

instance (ArgClass a, VariadicReturnClass r) => VariadicReturnClass (a -> r) where
   variadicImpl reqArgs acc = \a -> variadicImpl reqArgs (specialize a `mappend` acc)

For instance:

class SumRes r where 
    sumOf :: Integer -> r

instance SumRes Integer where
    sumOf = id

instance (Integral a, SumRes r) => SumRes (a -> r) where
    sumOf x = sumOf . (x +) . toInteger

then we could use

*Main> sumOf 1 :: Integer
1
*Main> sumOf 1 4 7 10 :: Integer
22
*Main> sumOf 1 4 7 10 0 0  :: Integer
22
*Main> sumOf 1 4 7 10 2 5 8 22 :: Integer
59

More Related Contents:

  1. How does Haskell printf work?
  2. How do I define Lisp’s apply in Haskell?
  3. Haskell \p -> not takeWhile
  4. Sum of two numbers with function in haskell
  5. How to group similar items in a list using Haskell?
  6. How do I deal with many levels of indentation?
  7. :sprint for polymorphic values?
  8. Writing foldl using foldr
  9. What does the “@” symbol mean in reference to lists in Haskell?
  10. New state of the art in unlimited generation of Hamming sequence
  11. How do you represent a graph in Haskell?
  12. Haskell types frustrating a simple ‘average’ function
  13. What’s the “|” for in a Haskell class definition?
  14. Lifting a higher order function in Haskell
  15. Distinction between typeclasses MonadPlus, Alternative, and Monoid?
  16. Function definition by special cases in GHCi
  17. What constitutes a fold for types other than list?
  18. Lambda for type expressions in Haskell?
  19. Pattern matching identical values
  20. Composing Monads v. Applicative Functors
  21. Abusing the algebra of algebraic data types – why does this work?
  22. What does the : infix operator do in Haskell?
  23. Why should Applicative be a superclass of Monad?
  24. withFile vs. openFile
  25. Monoidal Functor is Applicative but where is the Monoid typeclass in the definition of Applicative?
  26. How to return a pure value from a impure method
  27. How to convert Unicode Escape Sequence to Unicode String in Haskell
  28. Why does OCaml sometimes require eta expansion?
  29. Explanation of “tying the knot”
  30. Return specific type within Haskell

Leave a Comment