Revision as of 19:52, 22 March 2008 edit CRGreathouse (talk \| contribs) Autopatrolled, Administrators 13,002 edits m link ← Previous edit		Revision as of 13:55, 12 February 2012 edit undo Lambiam (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers 65,072 edits wikilink; tweak formulation Next edit →
Line 6: setofeven(X) <= <:x: x in X & even(x) :> The NPL interpreter evaluates the list of generators from left to right so conditions can mention any bound variables that occur to their left. These were known as [[set ~~comprehensions~~comprehension]]s. NPL eventually evolved into [[Hope programming language\|Hope]] but lost set comprehensions, which ~~were~~made a reappearance in the form ~~called~~of [[list comprehension]]s in later functional languages. ''Reference: John Darlington, "Program Transformation and Synthesis: Present Capabilities", Research Report No. 77/43, Dept. of Computing and Control, Imperial College of Science and Technology, London September 1977.''

NPL (programming language): Difference between revisions