ldionne on gh-pages
Update benchmarks to 490dbf6 fo… (compare)
ldionne on gh-pages
Update benchmarks to 490dbf6 fo… (compare)
ldionne on gh-pages
Update benchmarks to 490dbf6 fo… (compare)
ldionne on gh-pages
Update benchmarks to 490dbf6 fo… (compare)
ldionne on gh-pages
Update benchmarks to 490dbf6 fo… (compare)
constexpr
boolean predicates as their implementation expects (What about a clite
branch?). Then I could continue haskellizing both TMP and C++ with Hana as the starting point.
curry
adaptor.
curry
adaptor to emulate automatic currying. This makes things like f <transform> x <ap> y <ap> z
equivalent to curry(f) <transform> x <ap> y <ap> z
, where <...>
is just infix application of …
.
f
a function inside an Applicative
and n
arguments inside the same Applicative
, I simply fmap curry f
, which gives me an Applicative
of curried functions.
lazy
adaptor would help.
lazy
adaptor, we can only get superficial laziness at one level.
lazy
except in some simple cases (e.g. for conditional statements), and this is also why the usual Haskell concepts are broken up into more parts (Iterable
, Foldable
and Searchable
instead of just Foldable
in Haskell).
Being frankly the only use case that comes to my mind for laziness (From the C++ point of view) are infinite ranges and related. In depth laziness and non-strict functions are cool, but their advantages may not worth the effort. Let's forget lazy for now (right fold included).
I'm gonna try to focus on translating the existing concepts to CL for now.