Once again, the filmed outcome was not as important as the discussions between the children themselves and those that they worked with; and once again, the teachers were primed to push these discussions, prompting higher-order language
work, sustained individual contributions, detailed explanations and so on.
This implies continued development of language competence per se in L1 and L2, and the development of higher-order language
proficiency and additive bilingualism.
A flow analysis for a higher-order language collects data-flow and control-flow information about programs in the language.
A flow analysis for a higher-order language, on the other hand, must simultaneously compute control- and data-flow information, since the operator at a call site must be determined from data-flow information.
The analysis described in this article unifies and extends previous work on flow analyses for higher-order languages supporting assignment and control operators.
From the beginning, Moggi  took pains to stress that monads could be applied to a first-order language, independent of the machinery required for a higher-order language.
In a higher-order language, one can encode a new binding construct simply by adding a new constant.
Eminent declarative programmers, such as Warren  and Goguen , have claimed that higher-order languages offer no essential advantages over first-order languages.
In connection with this, the paper discusses some technical issues concerning infinitary type theories and the program of developing the semantics for higher-order languages
in other higher-order languages
Ada and C are both third-generation, procedural, block-structured higher-order languages
This article presents a flow analysis framework for call-by-value, higher-order languages.
For higher-order languages, a flow analysis must construct some approximation to the set of procedures applied at a given call site and some approximation to the set of values returned from a call.