While playing around with combinatory logic in Haskell, I decided to challenge myself with writing a point-free implementation of scanl1. After much head-banging, I "invented" my own combinator. Her name is Phoebe—both like the Greek Titaness and like the bird. Below I've provided a definition. This really is nothing serious; I just had lots of fun and decided to share if you'd like to use phoebe in your coding as well.

  scanl1' := Φ₂ scanl head tail
  foldl1' := Φ₂ foldl head tail
Combinator: C**(C*Φ*)