| BELLOT, P.: Higher Order Programming in Extended FP, Functional Programming Languages and Computer Architecture, LNCS 201, Springer 1985, pp. 65-80. |
....power of the query language is inferior to that of the l calculus. We feel that this is not a severe limitation because one can easily identify a set of functionals that meets the requirements of a DBPL. Extensions of FP to enable full higher order programming are considered, for example, in [Bel85, SS86] For convenience the semantics of the language is defined by function level equations which also may serve as (basic) laws for optimizations. We will give only those equations explaining the essence of some functionals which are of special interest in database languages; a more complete ....
BELLOT, P.: Higher Order Programming in Extended FP, Functional Programming Languages and Computer Architecture, LNCS 201, Springer 1985, pp. 65-80.
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