Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
This paper develops the Church-Rosser theorem for the rewriting system CCLβ on type-free categorial combinators introduced by Curien. The system CCLβ is not confluent. However we show that there are various sets D of categorical combinator terms such that each D satisfies the following two conditions: (1) D is closed under reduction by CCLβ; (2) CCLβ is confluent on D. Moreover we examine the relation among these sets. © 1989.
Eric Price, David P. Woodruff
FOCS 2011
Yao Qi, Raja Das, et al.
ISSTA 2009
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009