18 search results - page 2 / 4 » Fixed Points of Type Constructors and Primitive Recursion |
POPL
2007
ACM
14 years 6 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
FC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
CORR
2004
Springer
13 years 6 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
FSTTCS
1993
Springer
13 years 10 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...
LICS
1991
IEEE
13 years 9 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...