We don't have any images related to NPL (programming language) yet.
You can add one yourself here.
We don't have any YouTube videos related to NPL (programming language) yet.
You can add one yourself here.
We don't have any PDF documents related to NPL (programming language) yet.
You can add one yourself here.
We don't have any Books related to NPL (programming language) yet.
You can add one yourself here.
We don't have any archived web articles related to NPL (programming language) yet.
For other programming languages and concepts abbreviated as NPL, see NPL (disambiguation).
NPL is a functional programming language with pattern matching designed by Rod Burstall and John Darlington in 1977. The language allows certain sets and logic constructs to appear on the right hand side of definitions, e.g.
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. NPL eventually evolved into Hope but lost set comprehensions, which made a reappearance in the form of list comprehensions in later functional languages.
- John Darlington (1977). "Program Transformation and Synthesis: Present Capabilities". Research Report No. 77/43, Dept. of Computing and Control, Imperial College of Science and Technology, London.