- Author
- Phil Bagwell
- Published
- 2002
- Kind
- Technical report, read only as a catalog abstract
- Original
- infoscience.epfl.ch/entities/publication/d3fa1206-c368-469f-837d-c0412c44374c
- Subject
- Programming languages and types
What it is
Phil Bagwell wrote this report, which is listed in the EPFL Infoscience catalog. It proposes the VList as a replacement for the linked list in functional programming. The catalog page gives only the abstract.
What it says
- The report introduces the VList, which the abstract calls compact, thread safe and faster.
- The abstract claims space use falls by 50% to 90%. Typical list operations get faster by factors of 4 to 20 or more.
- Indexing and length drop from O(N) to O(1) and O(lgN) respectively.
- The abstract says a Common Lisp dialect interpreter, Visp, was built on VLists. It was compared with OCAML.
- The structure also adapts to variable length arrays, persistent deques and functional hash tables.
What evidence it gives
The abstract mentions a benchmark comparison against OCAML. The abstract gives no details of the tests. Nothing beyond the abstract was read.
Interests and limits
The live page showed a bot check, so an archived catalog copy was used. Only the abstract on an archived catalog page was read, not the report. All figures are the author's claims in the abstract.