Continued fractions and numeration in the Fibonacci base

Let φφ be the golden ratio. We define and study a continued φφ-fraction algorithm, inspired by Euclid's algorithm. We show that any non-negative element of Q(φ)Q(φ) has a finite continued φφ-fraction.