Sciweavers

1686 search results - page 1 / 338
» Higher Order Deforestation
Sort
View
FUIN
2006
85views more  FUIN 2006»
13 years 4 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 5 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
FROCOS
2011
Springer
12 years 4 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 3 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
DAGM
2010
Springer
13 years 2 months ago
An Empirical Comparison of Inference Algorithms for Graphical Models with Higher Order Factors Using OpenGM
Abstract. Graphical models with higher order factors are an important tool for pattern recognition that has recently attracted considerable attention. Inference based on such model...
Björn Andres, Jörg H. Kappes, Ullrich K&...