40 search results - page 5 / 8 » Unary Primitive Recursive Functions |
RTA
2009
Springer
14 years 4 months ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
FSTTCS
1993
Springer
14 years 1 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...