Generalizing generalized tries

DOI10.1017/S0956796800003713MaRDI QIDQ4519172zbMATH OpenFDO

Authors Ralf Hinze

Publication date 3 December 2000

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796800003713

zbMATH Keywords

search tree schemetrie

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A generalization of the trie data structure
• Improved behaviour of tries by adaptive branching
• Sorting and searching by distribution: from generic discrimination to generic tries
• Towards a complete characterization of tries
• scientific article; zbMATH DE number 3896283

Cited in

(14)

• Iteration and coiteration schemes for higher-order and nested datatypes
• Nested session types
• Higher-order pattern anti-unification in linear time
• On the stack-size of general tries
• Sorting and searching by distribution: from generic discrimination to generic tries
• Type Fusion
• Polarised subtyping for sized types
• A generalization of the trie data structure
• Generic top-down discrimination for sorting and partitioning in linear time
• scientific article; zbMATH DE number 7779293 (Why is no real title available?)
• Calculating datastructures
• Map fusion for nested datatypes in intensional type theory
• A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories
• Type-based termination of generic programs

This page was built for publication: Generalizing generalized tries

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