154 search results - page 13 / 31 » Cobham recursive set functions |
116
Voted
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
106
Voted
FSTTCS
1993
Springer
15 years 7 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...
125
Voted
TAPSOFT
1997
Springer
15 years 7 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
94
Voted
MA
2010
Springer
14 years 10 months ago
2010
Springer
Tail dependence and conditional tail dependence functions describe, respectively, the tail probabilities and conditional tail probabilities of a copula at various relative scales....
127
Voted
RAM
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...