Linear, bounded, functional pretty-printing

Swierstra, S. Doaitse and Chitil, Olaf (2009) Linear, bounded, functional pretty-printing. Journal of Functional Programming, 19 (01). pp. 1-16. ISSN 0956-7968. (Full text available)

PDF
Download (172kB)
[img]
Preview
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
Uncontrolled keywords: non-strict, lazy, Haskell
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 29 Mar 2010 12:11
Last Modified: 06 Sep 2011 04:53
Resource URI: http://kar.kent.ac.uk/id/eprint/24041 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year