Swierstra, S. Doaitse, Chitil, Olaf (2009) Linear, bounded, functional pretty-printing. Journal of Functional Programming, 19 (01). pp. 1-16. ISSN 0956-7968. (doi:10.1017/S0956796808006990) (KAR id:24041)
|
PDF
Language: English |
|
|
Download this file (PDF/192kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
| Official URL: http://dx.doi.org/10.1017/S0956796808006990 |
|
Abstract
We present two implementations of Oppen's pretty-printing algorithm in Haskell that meet the efficiency of Oppen's imperative solution but have a simpler, clear structure. We start with an implementation that uses lazy evaluation to simulate two co-operating processes. Then we present an implementation that uses higher-order functions for delimited continuations to simulate co-routines with explicit scheduling.
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1017/S0956796808006990 |
| Uncontrolled keywords: | non-strict, lazy, Haskell |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
|
| Depositing User: | Olaf Chitil |
| Date Deposited: | 29 Mar 2010 12:11 UTC |
| Last Modified: | 20 May 2025 10:11 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/24041 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Chitil, Olaf.
| Creator's ORCID: |
 https://orcid.org/0000-0001-7986-9929
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
