Generalizing generalized tries

DOI10.1017/S0956796800003713zbMath0965.68016MaRDI QIDQ4519172

Ralf Hinze

Publication date: 3 December 2000

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

zbMATH Keywords

triesearch tree scheme

Mathematics Subject Classification ID

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

Related Items (10)

Higher-order pattern anti-unification in linear time ⋮ Calculating datastructures ⋮ Map fusion for nested datatypes in intensional type theory ⋮ Unnamed Item ⋮ Polarised subtyping for sized types ⋮ Type-based termination of generic programs ⋮ Nested session types ⋮ Generic top-down discrimination for sorting and partitioning in linear time ⋮ Iteration and coiteration schemes for higher-order and nested datatypes ⋮ Type Fusion

This page was built for publication: Generalizing generalized tries