João Costa
@JD557@blog.joaocosta.eu
Follow
Portuguese software engineer at Kevel.
My instance is running on a small server so please #nobot
- GitHub
- Itch.io
@NicolasRinaudo@functional.cafe @adam_chal@hachyderm.io
I can absolutely imagine some people being happy with first class functions and being allowed to write code that a type checker must reject even though it's correct.
I've read somewhere that transducers (as in https://clojure.org/reference/transducers) are one such case.
I never looked into it too much nor tried to implement them in a type safe way. However, since I also only ever heard about that in closure, I assume that it might be quite hard to use them with type inference.
@JD557 @adam_chal interesting, I'll take a look - I don't think I'd heard the term before, or at least not used like that.
Another example of wanting a loose type system is the fix point combinator, which is so much easier to write if you can sometimes return the next step in the recursion as function, sometimes the final result, without a type checker complaining about it.
@adam_chal I would argue that it really depends on:
- what you mean by "functional" (does it mean "supports functions as values" or "everything is referentialy transparent"?)
- what you're optimising for (expressivity or correction?)
I can absolutely imagine some people being happy with first class functions and being allowed to write code that a type checker must reject even though it's correct.