Generic discrimination: sorting and partitioning unshared data in linear time

DOI10.1145/1411204.1411220MaRDI QIDQ5178758zbMATH OpenOpenAlexFDO

Authors Fritz Henglein

Publication date 16 March 2015

Published in Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1411204.1411220

zbMATH Keywords

discriminationdiscriminatorequivalencefunctionalgenericmultiset discriminationorderpartitioningsortingtotal preorder

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Generic top-down discrimination for sorting and partitioning in linear time
• Sorting and searching by distribution: from generic discrimination to generic tries
• What is a sorting function?
• Generic functional programming with types and relations
• Using multiset discrimination to solve language processing problems without hashing

Cited in

(4)

• Sorting and searching by distribution: from generic discrimination to generic tries
• Generic top-down discrimination for sorting and partitioning in linear time
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• What is a sorting function?

This page was built for publication: Generic discrimination: sorting and partitioning unshared data in linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178758)