Nondeterministic Programs Definable in Typed λ-Calculus
Marek Zaionc · Fundamenta Informaticae · 1985
In this paper term grammars are introduced. The expressing power of this grammars with variables of natural number type are just the nondeterministic programs built up without composition but with iteration of extended polynomials.