60 search results - page 1 / 12 » Bootstrapping higher-order program transformers from interpr... |
64
Voted
SAC
1996
ACM
15 years 5 months ago
1996
ACM
156
Voted
ICFP
1997
ACM
15 years 5 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
115
click to vote
FUIN
2006
15 years 1 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
138
Voted
CADE
2005
Springer
16 years 1 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
196
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...