D. Suciu and V. Breazu-Tannen. A Query Language for the Class NC, August 1993. Manuscript available from suciu@saul.cis.upenn.edu.  Home/Search   Document Not in Database   Summary   Related Articles

....function using SRI: define h(fj jg) e j h(add(nx; ns) u(f(x) h(s) The side conditions imposed on the functions used in both SRI and SRU are annoying. As the functions i or u become more complicated, it becomes impossible for a compiler to check them: in fact, checking them is undecidable [8, 28]. However, there are important special cases of SRU where these equations are automatically satisfied. Namely when e = fj jg; u = Phi (or e = f g; u = for sets, and e = fjj jjg; u = for lists) Then, the more restrictive form of structural recursion is given by the following template: ....

....a necessarily exponential implementation in complex object algebra [3] 14] show how to encode related database languages in the simply typed lambdacalculus. The possibility of using comprehension syntax for arrays is examined in [11] Connections with parallel complexity classes are studied in [28]. ....

D. Suciu and V. Breazu-Tannen. A Query Language for the Class NC, August 1993. Manuscript available from suciu@saul.cis.upenn.edu.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC