fact: Definition FibonacciSpec : funType ((nat : Type) :: @nil Type)%list nat := LeastFixedPoint (fDom := (nat : Type) :: @nil Type)%list (fun rec (n : nat) => match n with | 0 => { x | x < 1} | 1 => ret 1 | S (S n') => n1 <- rec n'; n2 <- rec (S n'); ret (n1 + n2) end).
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Sets.Ensembles Coq.ZArith.ZArith Coq.Classes.Morphisms Coq.Classes.SetoidTactics Fiat.Computation Fiat.Computation.SetoidMorphisms Coq.Logic.FunctionalExtensionality