Simplest poly-variadic fixpoint combinators for mutual recursion Many ways to write the fixed-point combinator in a typed practical language Self-application and recursion: the U combinator Fixpoint combinators are infinitely many and recursively-enumerable Y overriding self-application: Y in practical programs Self-application as the fixpoint of call/cc Self-quoting fixpoints: Quines, in Scheme a