179 search results - page 24 / 36 » A calculus of functional BSP programs |
148
click to vote
ESOP
2006
Springer
15 years 9 months ago
2006
Springer
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
153
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...
145
Voted
POPL
2010
ACM
16 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
273
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
148
Voted
ACSC
2006
IEEE
15 years 11 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...