3670 search results - page 37 / 734 » Linear Recursive Functions |
110
click to vote
CORR
2010
Springer
15 years 5 days ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
104
click to vote
POPL
2000
ACM
15 years 6 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
109
click to vote
APLAS
2010
ACM
15 years 2 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
120
click to vote
DAC
2004
ACM
16 years 3 months ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
102
click to vote
ML
2008
ACM
15 years 2 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...