2477 search results - page 236 / 496 » Parallelizing Functional Programs by Generalization |
179
click to vote
CONCUR
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
287
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
165
click to vote
ICFP
2001
ACM
16 years 6 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
298
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
We propose a new technique for hardware synthesis from higherorder functional languages with imperative features based on Reynolds's Syntactic Control of Interference. The re...
157
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...