Given a type A we define a quotient inductive type Mobile A with the following constructors: leaf:Mobile A node:(A→Mobile A)→Mobile A perm:∀f (π:A↔A)→node f=node(f∘π) References altenkirch2016-qiit