Sciweavers

261 search results - page 29 / 53
» Proof Normalization Modulo
Sort
View
ENTCS
2002
128views more  ENTCS 2002»
13 years 8 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
LICS
2010
IEEE
13 years 6 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
JCT
2011
62views more  JCT 2011»
13 years 3 months ago
Anti-lecture hall compositions and overpartitions
We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k − 2 equals the number of overpartitions of n with non-overlined parts not con...
William Y. C. Chen, Doris D. M. Sang, Diane Y. H. ...
SIAMNUM
2010
129views more  SIAMNUM 2010»
13 years 3 months ago
Convergence of an Adaptive Finite Element Method for Controlling Local Energy Errors
A number of works concerning rigorous convergence theory for adaptive finite element methods (AFEM) for controlling global energy errors have appeared in recent years. However, man...
Alan Demlow
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 2 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal