Sciweavers

5863 search results - page 271 / 1173
» Calculating Functional Programs
Sort
View
PADL
2007
Springer
16 years 23 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
POPL
2007
ACM
16 years 7 months ago
Scrap your boilerplate with XPath-like combinators
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...
Ralf Lämmel
ICALP
2005
Springer
16 years 4 days ago
The Polyranking Principle
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...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
FLOPS
2008
Springer
15 years 8 months ago
On-Demand Refinement of Dependent Types
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...
Hiroshi Unno, Naoki Kobayashi
ACL2
2006
ACM
16 years 18 days ago
Adding parallelism capabilities to ACL2
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
David L. Rager