Chitil, Olaf (2005) Pretty printing with lazy dequeues. Transactions on Programming Languages and Systems, 27 (1). pp. 163-184. ISSN 0164-0925. (doi:10.1145/1053468.1053473) (KAR id:14377)
PDF
Language: English |
||
Download (245kB)
Preview
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
Official URL http://dx.doi.org/10.1145/1053468.1053473 |
Abstract
There are several purely functional libraries for converting tree structured data into indented text, but they all make use of some backtracking. Over twenty years ago, Oppen published a more efficient imperative implementation of a pretty printer. This article shows that the same efficiency is also obtainable without destructive updates by developing a similar but purely functional Haskell implementation with the same complexity bounds. At its heart lie two lazy double ended queues.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1145/1053468.1053473 |
Uncontrolled keywords: | Algorithms, Haskell, lazy functional programming |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Faculties > Sciences > School of Computing > Theoretical Computing Group |
Depositing User: | Olaf Chitil |
Date Deposited: | 24 Nov 2008 18:03 UTC |
Last Modified: | 23 Jan 2020 04:02 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14377 (The current URI for this page, for reference purposes) |
Chitil, Olaf: | ![]() |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):