This HTML5 document contains 35 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
schemahttp://schema.org/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n12http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:NPL_(programming_language)
rdf:type
wikidata:Q315 schema:Language dbo:Language owl:Thing dbo:ProgrammingLanguage wikidata:Q9143
rdfs:label
NPL (programming language)
rdfs:comment
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) :>
owl:sameAs
freebase:m.03sktd yago-res:NPL_(programming_language)
dbp:wikiPageUsesTemplate
dbt:Multiple_issues dbt:Primary_sources dbt:Compu-lang-stub dbt:No_footnotes dbt:For
dct:subject
dbc:Academic_programming_languages dbc:History_of_computing_in_the_United_Kingdom dbc:Functional_languages
gold:hypernym
dbr:Language
prov:wasDerivedFrom
n12:NPL_(programming_language)?oldid=1057872386&ns=0
dbo:wikiPageID
948982
dbo:wikiPageLength
1240
dbo:wikiPageRevisionID
1057872386
dbo:wikiPageWikiLink
dbc:Academic_programming_languages dbc:Functional_languages dbr:Set-builder_notation dbc:History_of_computing_in_the_United_Kingdom dbr:Pattern_matching dbr:John_Darlington dbr:Functional_programming dbr:List_comprehension dbr:Hope_(programming_language) dbr:Rod_Burstall
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.
foaf:isPrimaryTopicOf
n12:NPL_(programming_language)