Sciweavers

45 search results - page 5 / 9
» haskell 2007
Sort
View
PADL
2007
Springer
14 years 11 days ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
HASKELL
2007
ACM
13 years 10 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
APLAS
2007
ACM
13 years 10 months ago
Monadic, Prompt Lazy Assertions in Haskell
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
Olaf Chitil, Frank Huch
POPL
2007
ACM
14 years 6 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
ENTCS
2007
100views more  ENTCS 2007»
13 years 6 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier