4757 search results - page 209 / 952 » Monads for Functional Programming |
259
click to vote
PADL
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforest...
167
click to vote
PADL
2007
Springer
16 years 18 days ago
2007
Springer
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...
288
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
174
click to vote
ICALP
2005
Springer
16 years 1 hour ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
179
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...