Report - Induction-Recursion A polymorphic representation · Leftist heaps are heap-ordered binary trees that satisfy the leftist property: the rank of any left child is at least as large

Select PornographicDefamatoryIllegal/UnlawfulSpamOther Terms Of Service ViolationFile a copyright complaint

Please pass captcha verification before submit form