A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Generic discrimination

2008
*
Proceeding of the 13th ACM SIGPLAN international conference on Functional programming - ICFP '08
*

We introduce the notion of discrimination as a generalization of both sorting and partitioning and show that worst-case linear-time discrimination functions (discriminators) can be defined generically, by (co-)induction on an expressive language of order denotations. The generic definition yields discriminators that generalize both distributive sorting and multiset discrimination. The generic discriminator can be coded compactly using list comprehensions, with order denotations specified using

doi:10.1145/1411204.1411220
dblp:conf/icfp/Henglein08
fatcat:lpf4jzjqorefrhtkbd3ap5z7ki