Rather than a monad stack, are there any PLs where functions can just have a set of statically verified properties attached?
Related Posts
Go has an elegant approach to defining example functions, which are shown in docs as `main()` with the output: https://go.dev/blog/examples
Co-Authored-By: An old Stack Overflow answer, blindly accepting the compiler's suggestions, and a linter.
I really like the MELPA model of packaging directly from git. It solves the problem of forgetting to release something -- just merge a PR and you're done.
It also makes version number bumps much less important.
You could go even further in a statically typed language and also figure out when breaking changes occur.