Mini-indexes for literate programs
<|reference_start|>Mini-indexes for literate programs: This paper describes how to implement a documentation technique that helps readers to understand large programs or collections of programs, by providing local indexes to all identifiers that are visible on every two-page spread. A detailed example is given for a program that finds all Hamiltonian circuits in an undirected graph.<|reference_end|>
@article{knuth1994mini-indexes,
    title={Mini-indexes for literate programs},
    author={Donald E. Knuth},
    journal={Software -- Concepts and Tools 15 (1994), 2--11},
    year={1994},
    number={Knuth migration 11/2004},
    archivePrefix={arXiv},
    eprint={cs/9401102},
    primaryClass={cs.PL}
}