News for hackers. Stuff that matters.
Re:Why nullable types? by coldtea on Wednesday December 09, 2020 @02:46AM (#25356316)
>By compose I quite literally mean the compose function.

Outside Lisp/Scheme has anybody used those for anything other than examples in FP tutorials?

Every case I ever seen is non-production tutorial thing like "add3".

Re:Why nullable types? by bern4444 on Sunday December 13, 2020 @03:45AM (#25405184)
I do on a regular basis (front end dev). For an example of how, I found this article[1] to be a nice demonstration of how it can be useful at a basic level for ReactJS. Than you just begin applying the same concepts one level higher for your use case and keep going.

Even if you don't use compose directly, the mindset of working to build systems in a composable manner is invaluable.

Its a mental shift that leads you to thinking how a system can be represented as a series of inputs being piped from one function to the next between boundries of my code (server response data --> client side caller --> transformation functions --> local data store --> UI).

Achieving these pipelines requires expressing intent with functions and with a self imposed constraint of writing pure functions, you begin needing functors and applicatives and monads to help store stateful information.

If at any point you need a new capability or need to add a new code path, you just modify the relevant pipeline(s), write any new (pure) functions along with any adapters you might need to inject it in your pipeline, and you're good to go. If everything is a pure function, testing and debugging instantly become easier. All this from wanting to build composable functions.

Some languages also support piping (runs the functions in the reverse order that compose does) which can help visually since functions are invoked in left to right order which is how we read too.

[1] https://hackernoon.com/forms-of-composition-in-javascript-an...

Re:Why nullable types? by kazinator on Thursday December 10, 2020 @02:16PM (#25377268)
Threading syntax is a giant compose. OK, but that's an operator.

In the TXR internals, I have a C function called chain, which composes N functions together (left to right, not right to left like typical compose functions). It is variadic: the end of the arguments is signaled by nao: a not-an-object constant:

  git grep '\<chain('
  eval.c:                       chain(car_f, eq_to_list_f, nao),
  eval.c:                        chain(cdr_f, consp_f, nao),
  eval.c:                        chain(cdr_f, cdr_f, null_f, nao),
  eval.c:                        chain(car_f, eq_to_quote_f, nao),
  eval.c:                                   chain(car_f, eq_to_list_f, nao),
  eval.c:                                   chain(cdr_f, consp_f, nao),
  eval.c:                                   chain(cdr_f, cdr_f, null_f, nao),
  eval.c:                                   chain(cdr_f, car_f, consp_f, nao),
  eval.c:                                   chain(cdr_f, car_f, car_f, eq_to_quote_f, nao),
  eval.c:                              chain(cdr_f, car_f, cdr_f,
  eval.c:  return chain(juxt_fun, apf_fun, nao);
  eval.c:  iter_from_binding_f = chain(cdr_f, iter_begin_f, nao);
  lib.c:  val pred_key = chain(default_arg(key, identity_f), pred, nao);
  lib.c:  val pred_key = chain(default_arg(key, identity_f), pred, null_f, nao);
  lib.c:val chain(val first_fun, ...)
  lib.c:                     chain(car_f, keyfun_in, nao));
  lib.h:val chain(val first_fun, ...);
  match.c:                                      chain(func_n1(cdr),
  match.c:                              chain(func_n1(cdr),
  match.c:                                        chain(func_n1(length_list),
  match.c:                                        chain(func_n1(rest),
The _f variables are pre-computed function objects, stored in globals, to avoid consing them repeatedly. That func_n1(cdr) seen in match.c could be replaced by cdr_f , not to mention by the func_f1(rest); it conses a new function object referencing the C function cdr each time it is called.