Home
Schedule
Abstract Template
Masters Attendance
Center
Home
Courses
People
Projects
Page
Edit Page
Rename Page
Attach File
Printable
Wiki Source
More ...
Web
Recent Changes
Notify Service
News
Page Index
Search
More ...
Wiki
About TWiki
Text Formatting
Registration
Change Password
Reset Password
Users
Groups
Log In
or
Register
Rewriting Haskell Strings
Stc
Date: 2006-11-23 Time: 11:45 Room: BBL room 471 ----+++ Speaker: [[http://www.cs.uu.nl/~doaitse][Doaitse Swierstra]] ----+++ Title: Rewriting Haskell Strings [[#OrigAuth][(*)]] ----+++ Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, <nop>ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict arrays with lazy evaluation. Equational transformations based on term rewriting are used to deforest intermediate <nop>ByteStrings automatically. We describe novel fusion combinators with improved expressivity and performance over previous functional array fusion strategies. A library for <nop>ByteStrings is implemented, providing a purely functional interface, and approaches the speed of low-level mutable arrays in C. #OrigAuth (*) Authors: Duncan Coutts (Programming Tools Group, Oxford University Computing Laboratory) Don Stewart and Roman Leshchinskiy (Computer Science & Engineering, University of New South Wales) Accepted for PADL 2007.
