So far I have seen numerous "Maybe" versions of certain partial functions that would potentially result in ⊥, like readMaybe for read and listToMaybe for head; sometimes I wonder if we ca...

Scala has a very nice support of partial functions, mainly because in Scala when you define a partial function it also defines an isDefinedAt function for it. And also Scala has orElse and andThe...

Since a total function is a special case of a partial function, I think I should be able to return a function when I need a partial. Eg, def partial : PartialFunction[Any,Any] = any => any O...

According to my understanding, partial functions are functions that we get by passing fewer parameters to a function than expected. For example, if this were directly valid in Python: >>>...

According to the Haskell wiki, the scanl1 function is partial. I don't understand what inputs result in bottom, though. For list functions, I'm used to the problem inputs either being empty lists (...

How is the head and tail determined in the following statement: val head::tail = List(1,2,3,4); //head: 1 tail: List(2,3,4) Shouldn't there be some piece of code which extracts the first eleme...

Why does this fail to compile: trait Item trait StringItem extends Item { def makeString: String } trait SomeOtherItem extends Item trait DummyTrait case class Marquee(items: Seq[Item]) exten...

take (-1) [] is []. What are the reasons to prefer this over a partial function, that is, an error? Are there use cases where this property is exploited?

So, I have made this function called tryMap which is as follows: /// tryMap, with failure and success continuations. let rec tryMapC : 'R -> ('U list -> 'R) -> ('T -> 'U option) -> ...

This is a follow-up of Why am I getting "Non-exhaustive patterns in function..." when I invoke my Haskell substring function? I understand that using -Wall, GHC can warn against non-exha...