Generalizing Generalized Tries

Generalizing Generalized Tries (1999)

by Ralf Hinze

Citations:

29 - 8 self

Datum	Value	Source
TITLE	1 Generalizing Generalized Tries	SVM HeaderParse 0.1
AUTHOR NAME	Ralf Hinze	SVM HeaderParse 0.1
AUTHOR ADDR	Romerstra��e 164, 53117 Bonn, Germany	SVM HeaderParse 0.1
ABSTRACT	A trie is a search tree scheme that employs the structure of search keys to organize information. Tries were originally devised as a means to represent a collection of records indexed by strings over a fixed alphabet. Based on work by C.P. Wadsworth and others, R.H. Connelly and F.L. Morris generalized the concept to permit indexing by elements of an arbitrary monomorphic datatype. Here we go one step further and define tries and operations on tries generically for arbitrary first-order polymorphic datatypes. The derivation is based on techniques recently developed in the context of polytypic programming. It is well known that for the implementation of generalized tries nested datatypes and polymorphic recursion are needed. Implementing tries for polymorphic datatypes places even greater demands on the type system: it requires rank-2 type signatures and higher-order polymorphic nested datatypes. Despite these requirements the definition of generalized tries for polymorphic datatypes is surprisingly simple which is mostly due to the framework of polytypic programming. All generalizations are dangerous, even this one.--- Alexandre Dumas	SVM HeaderParse 0.1
CITATIONS	14 found	ParsCit 1.0