Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...