Is Constrast Evaluated?

The first one is a a if constaval am. And that lets you branch inside of a consexper function based on whether or not a that function is being evaluated at compile time or at run time. The second allows you basically, it's showing that you no longer need to use the y combinator for recursive lamdas. Third example? Turns out that this is also a replacement for the c r t, p a, k a, the curiously recurring template pattern,. which i have actually never used in anger, but a reallit.