It still can panic/abort and deadlock/wait infinitely long on most fp languages because that’s typically implied. And there isn’t actually a way around that because computation almost always can fail or block indefinitely - and if you have a total language you can implement waits for billions of years, which for all practical purposes is “infinitely” long on human time scales.
Boolean functions have potentially infinite return states depending on error handling
etc
Not in my functional language with no nulls :P
It still can panic/abort and deadlock/wait infinitely long on most fp languages because that’s typically implied. And there isn’t actually a way around that because computation almost always can fail or block indefinitely - and if you have a total language you can implement waits for billions of years, which for all practical purposes is “infinitely” long on human time scales.