Content deleted Content added
m Changing {{cleanup}} to {{cleanup-date|November 2005}} |
m More footnotes |
||
(24 intermediate revisions by 17 users not shown) | |||
Line 1:
{{for|other programming languages and concepts abbreviated as NPL|NPL (disambiguation)}}
{{multiple issues|
{{primary sources|date=July 2019}}
{{More footnotes|date=July 2019}}
}}
'''NPL'''
▲'''NPL''' was a [[functional language]] with [[pattern matching]] designed by Rod Burstall and John Darlington in 1977. The language allowed 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
''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.''▼
==References==
{{Reflist}}
▲
[[Category:History of computing in the United Kingdom]]
▲[[Category:Historical programming languages]]
▲[[Category:PL/I dialects]]
{{compu-lang-stub}}
|