fact: Fixpoint llist A p (xs : seq A) {struct xs} := if xs is x::xt then fun h => exists r h', h = p :-> (x, r) \+ h' /\ llist r xt h' else fun h : heap => p = null /\ h = Unit.
imports: Coq(ssreflect ssrbool ssrfun Eqdep) mathcomp(ssrnat eqtype seq path) pcm(options axioms finmap) pcm(pcm unionmap)