Linear ramified higher type recursion and parallel complexity

Abstract. A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactlycharacterize the parallel complexityclass NC. This is achieved byuse of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint