Sciweavers

5415 search results - page 63 / 1083
» The Implementation of Functional Programming Languages
Sort
View
PEPM
1993
ACM
14 years 1 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
POPL
2003
ACM
14 years 9 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
POPL
2003
ACM
14 years 9 months ago
Guarded recursive datatype constructors
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
Hongwei Xi, Chiyan Chen, Gang Chen
ICFP
2012
ACM
11 years 11 months ago
Nested data-parallelism on the gpu
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
Lars Bergstrom, John H. Reppy
ICFP
2007
ACM
14 years 9 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones