| dbo:abstract
|
- 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. (en)
- NPL（New Programming Language：新编程语言），是具有模式匹配和集合推导式的简单的纯函数式编程语言，在1973年至1975年，由爱丁堡大学的和，在关于的工作中设计，并于1977年用POP-2实现。 (zh)
|
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 1240 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| gold:hypernym
| |
| rdf:type
| |
| rdfs:comment
|
- NPL（New Programming Language：新编程语言），是具有模式匹配和集合推导式的简单的纯函数式编程语言，在1973年至1975年，由爱丁堡大学的和，在关于的工作中设计，并于1977年用POP-2实现。 (zh)
- 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) :> (en)
|
| rdfs:label
|
- NPL (programming language) (en)
- NPL (编程语言) (zh)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
