Sciweavers

417 search results - page 11 / 84
» Orderings for Innermost Termination
Sort
View
LICS
1991
IEEE
13 years 11 months ago
Higher-Order Critical Pairs
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Tobias Nipkow
IFIP
2009
Springer
13 years 5 months ago
Making PROFIT at the Intermodal Terminal - A Research Agenda
: Intermodality has been a hot topic in the logistics sector for several decades, but the expected diffusion into business is still limited. The key to increased intermodalism lies...
Torbjörn H. Netland, Ingrid Spjelkavik
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Higher Order Deforestation
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...
Geoff W. Hamilton
POPL
2009
ACM
14 years 8 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
WSC
2008
13 years 9 months ago
Controls: Emulation to improve the performance of container terminals
Nowadays container terminals are struggling with a continuously increasing volume. Therefore, they are searching for solutions to increase throughput capacity without expanding th...
Csaba A. Boer, Yvo Saanen