Mini-indexes for literate programs

Simple item page
dc.creatorKnuth, Donald E.
dc.date1994-01-01
dc.date.accessioned2026-07-07T09:12:18Z
dc.date.available2026-07-07T09:12:18Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/cs/9401102
dc.identifierhttp://arxiv.org/abs/cs/9401102
dc.identifierSoftware -- Concepts and Tools 15 (1994), 2--11
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151976
dc.subjectProgramming Languages
dc.titleMini-indexes for literate programs
dc.typetext

Files

Collections

arXiv