3670 search results - page 27 / 734 » Linear Recursive Functions |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
JSYML
2010
13 years 4 months ago
2010
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
We present a new method and system, called IGOR2, for the induction of recursive functional programs from few nonrecursive, possibly non-ground example equations describing a subse...
ENTCS
2006
13 years 9 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
FPCA
1991
14 years 1 months ago
1991
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...