0
size
returns positive valuesavg
head
and tail
are Safefoldr1
average
map
init
init'
insert
List
s ElementsList
keys
Map
eval
create
unsafeTake
unpack
chop
head
and tail
are Safefoldr1
average
map
init
init'
{#assdidl} ===========
Previously we saw how to refine the list data definition to get ordered lists:
{-@ data OList a =
OEmp
| (:<:) { oHd :: a
, oTl :: OList {v:a | oHd <= v}} @-}