Phoebe

---

Home

General ├─ Gallery ├─ Links └─ Webring

Tech ├─ ⇨ Phoebe ⇦ └─ ↳Stagit

OCS ├─ Texts │ ├─ John Alexander │ ├─ 8 Parts of Speech │ ├─ Story of the letters │ └─ Prayer Book ├─ Loanwords ├─ Orthography ├─ Stems └─ Phonology

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.

Φ₂:=λabcde.ad(be)(ce)
Use:
  scanl1' := Φ₂ scanl head tail
  foldl1' := Φ₂ foldl head tail
Combinator: C**(C*Φ*)
SK-Form:
((S(K(S(K((S((S(K((S(KS))K)))S))(KK))))))
((S(K((S((S(K((S(KS))K)))S))(KK))))
(S(K((S(K(S(KS))))((S(KS))K))))))
	

---