### Abstract

This article formalizes the “trie” data structure invented by Fredkin [CACM 1960]. It also provides a specialization where the entries in the trie are lists.

### License

BSD License

### Extra 0

Origin: This article was extracted from existing articles by the authors.

### Topics

- Computer science/Data structures

### Session Trie

- Trie
- Tries

### Used by

- Light-weight Containers
- Knowledge-based programs
- Collections Framework
- Jinja with Threads
- Flyspeck I: Tame Graphs

## Cite

×

Trie-AFP

    @article{Trie-AFP,
      author  = {Andreas Lochbihler and Tobias Nipkow},
      title   = {Trie},
      journal = {Archive of Formal Proofs},
      month   = {March},
      year    = {2015},
      note    = {\url{https://isa-afp.org/entries/Trie.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Mar 30, 2015 : Isabelle2014