partial-functions – Tarik Billa

In Haskell, why non-exhaustive patterns are not compile-time errors?

December 3, 2023 by Tarik

There are cases where you don’t mind that a pattern match is non-exhaustive. For example, while this might not be the optimal implementation, I don’t think it would help if it didn’t compile: fac 0 = 1 fac n | n > 0 = n * fac (n-1) That this is non-exhaustive (negative numbers don’t … Read more

What exactly is meant by “partial function” in functional programming?

February 21, 2023 by Tarik

You are here confusing two concepts. A partially applied function [haskell-wiki] with a partial function [haskell-wiki]. A partially applied function is: Partial application in Haskell involves passing less than the full number of arguments to a function that takes multiple arguments. whereas a partial function indeed is a non-total function: A partial function is a … Read more