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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
n12https://www.cs.cmu.edu/~kw/scans/
yagohttp://dbpedia.org/class/yago/
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#
n13https://theory.stanford.edu/~jcm/books/
n16http://www.cs.bham.ac.uk/~mhe/papers/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
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/
n19https://web.archive.org/web/20071213234103/http:/www.cs.pomona.edu/classes/cs131/Parsers/

Statements

Subject Item
dbr:Programming_Computable_Functions
rdf:type
yago:Language106282651 yago:Abstraction100002137 yago:WikicatFunctionalLanguages yago:Communication100033020 dbo:Language
rdfs:label
Programming Computable Functions
rdfs:comment
In computer science, Programming Computable Functions (PCF) is a typed functional language introduced by Gordon Plotkin in 1977, based on previous unpublished material by Dana Scott. It can be considered to be an extended version of the typed lambda calculus or a simplified version of modern typed functional languages such as ML or Haskell.
dcterms:subject
dbc:Programming_languages_created_in_1977 dbc:Functional_languages dbc:Academic_programming_languages dbc:Educational_programming_languages dbc:Programming_language_theory
dbo:wikiPageID
3239232
dbo:wikiPageRevisionID
1113307537
dbo:wikiPageWikiLink
dbr:Theoretical_Computer_Science_(journal) dbr:Typed_lambda_calculus dbr:Scott-continuous dbc:Functional_languages dbr:Fixed-point_combinator dbr:Gordon_Plotkin dbr:Ralph_Loader dbr:Dana_Scott dbr:Haskell_(programming_language) dbr:Fully_abstract dbr:Parallel_or dbr:ML_programming_language dbr:Kripke_logical_relations dbc:Academic_programming_languages dbr:Least_fixed_point dbr:Computer_science dbr:Type_system dbr:Game_semantics dbr:Functional_programming dbr:Λ-abstraction dbc:Educational_programming_languages dbr:Robin_Milner dbc:Programming_language_theory dbc:Programming_languages_created_in_1977 dbr:Cartesian_closed dbr:Domain_theory
dbo:wikiPageExternalLink
n12:scott93tcs.pdf n13:fpl-chap2.ps n16:RNC3.pdf n19:parsePCF.sml
owl:sameAs
wikidata:Q7248484 n18:4taEc freebase:m.090jt4 yago-res:Programming_Computable_Functions
dbp:wikiPageUsesTemplate
dbt:Cite_book dbt:Cite_journal dbt:R dbt:Rp dbt:Short_description dbt:Reflist dbt:Harv
dbp:group
note
dbp:r
"PCF is a programming language for computable functions, based on LCF, Scott’s logic of computable functions." Programming Computable Functions is used by . It is also referred to as Programming with Computable Functions or Programming language for Computable Functions.
dbo:abstract
In computer science, Programming Computable Functions (PCF) is a typed functional language introduced by Gordon Plotkin in 1977, based on previous unpublished material by Dana Scott. It can be considered to be an extended version of the typed lambda calculus or a simplified version of modern typed functional languages such as ML or Haskell. A fully abstract model for PCF was first given by Robin Milner. However, since Milner's model was essentially based on the syntax of PCF it was considered less than satisfactory. The first two fully abstract models not employing syntax were formulated during the 1990s. These models are based on game semantics and . For a time it was felt that neither of these models was completely satisfactory, since they were not effectively presentable. However, demonstrated that no effectively presentable fully abstract model could exist, since the question of program equivalence in the finitary fragment of PCF is not decidable.
gold:hypernym
dbr:Language
prov:wasDerivedFrom
wikipedia-en:Programming_Computable_Functions?oldid=1113307537&ns=0
dbo:wikiPageLength
8641
foaf:isPrimaryTopicOf
wikipedia-en:Programming_Computable_Functions
Subject Item
dbr:Let_expression
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
Subject Item
dbr:Gordon_Plotkin
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
dbp:knownFor
dbr:Programming_Computable_Functions
dbo:knownFor
dbr:Programming_Computable_Functions
Subject Item
dbr:PCF
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
dbo:wikiPageDisambiguates
dbr:Programming_Computable_Functions
Subject Item
dbr:Programming_language_theory
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
Subject Item
dbr:Logic_of_Computable_Functions
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
Subject Item
dbr:ALGOL
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
Subject Item
dbr:John_C._Reynolds
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
Subject Item
dbr:Programming_language_for_Computable_Functions
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
dbo:wikiPageRedirects
dbr:Programming_Computable_Functions
Subject Item
dbr:Programming_with_Computable_Functions
dbo:wikiPageWikiLink
dbr:Programming_Computable_Functions
dbo:wikiPageRedirects
dbr:Programming_Computable_Functions
Subject Item
wikipedia-en:Programming_Computable_Functions
foaf:primaryTopic
dbr:Programming_Computable_Functions