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.
YouTube Encyclopedic
-
1/3Views:134 17842 199362 834
-
Natural Language Processing: Crash Course Computer Science #36
-
Neuro-linguistic Programming NLP explained in one minute
-
Natural Language Processing With Python and NLTK p.1 Tokenizing words and Sentences
Transcription
References
- 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.
 | This programming-language-related article is a stub. You can help Wikipedia by expanding it. |
This page was last edited on 30 November 2021, at 04:20