Sciweavers

4716 search results - page 440 / 944
» Tangible functional programming
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Qualified types for MLF
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...
Andres Löh, Daan Leijen
ICFP
2004
ACM
16 years 6 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
ESOP
2010
Springer
16 years 4 months ago
Formal Verification of Coalescing Graph-Coloring Register Allocation
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
Andrew W. Appel, Benoît Robillard, Sandrine ...
SOFSEM
2009
Springer
16 years 3 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
PADL
2010
Springer
16 years 3 months ago
Conversion by Evaluation
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
Mathieu Boespflug