325 search results - page 41 / 65 » Proofs of Restricted Shuffles |
ENTCS
2002
13 years 9 months ago
2002
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
ENTCS
2007
13 years 9 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
AMC
1999
13 years 9 months ago
1999
The stability of the equilibria of time-invariant nonlinear dynamical systems with discrete time scale is investigated. We present an elementary proof showing that in the case of ...
FFA
2010
13 years 8 months ago
2010
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
NA
2010
13 years 8 months ago
2010
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed...