2394 search results - page 64 / 479 » Implementing Mobile Haskell |
WFLP
2009
Springer
14 years 3 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
PACT
2009
Springer
14 years 3 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
ICIW
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we present an extension of PHIL, a declarative language for filtering information from XML data. The proposed approach allows us to extract relevant data as well a...
TYPES
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
TLDI
2003
ACM
14 years 2 months ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...