Re: Motion 42: NO
On 2013-02-11 03:30:23 +0100, Vincent Lefevre wrote:
> But this doesn't take into account the case where ill is attached to
> an input variable, when instantiated.
>
> Or you need to say what happens at the leaves of the computation tree.
I think an idea could be to map an expression to a class of functions.
An expression defines a function f with 3 kinds of arguments:
variables x_i, valid constants c_j, and invalid constants n_k.
It can be written:
f(x_1,...,x_r,c_1,...,c_s,n_1,...,n_t)
Consider that:
* an argument x_i is replaced by an arbitrary function g_i (the
interval and decoration parts of x_i will imply constraints on
g_i);
* an argument c_j is replaced by an arbitrary constant function
with value c_j;
* an argument n_k is replaced by an arbitrary function whose domain
is empty.
Note: if t > 0, the domain will be empty (but in general, t = 0).
The FTIA and FTDIA will be satisfied for all the functions in the
obtained class.
--
Vincent Lefèvre <vincent@xxxxxxxxxx> - Web: <http://www.vinc17.net/>
100% accessible validated (X)HTML - Blog: <http://www.vinc17.net/blog/>
Work: CR INRIA - computer arithmetic / AriC project (LIP, ENS-Lyon)