Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7248484> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Q7248484 subject Q7036022.
- Q7248484 subject Q7134504.
- Q7248484 subject Q7134862.
- Q7248484 subject Q7467458.
- Q7248484 subject Q8161710.
- Q7248484 abstract "In computer science, Programming Computable Functions, or PCF, is a typed functional language introduced in an unpublished 1969 manuscript 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.A fully abstract model for PCF was first given by Milner (1977). However, since Milner's model was essentially based on the syntax of PCF it was considered less than satisfactory (Ong, 1995). The first two fully abstract models not employing syntax were formulated during the 1990s. These models are based on game semantics (Hyland and Ong, 2000; Abramsky, Jagadeesan, and Malacaria, 2000) and Kripke logical relations (O'Hearn and Riecke, 1995). For a time it was felt that neither of these models was completely satisfactory, since they were not effectively presentable. However, Ralph Loader 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.".
- Q7248484 wikiPageExternalLink index.html.
- Q7248484 wikiPageExternalLink scott93tcs.pdf.
- Q7248484 wikiPageExternalLink LCF.pdf.
- Q7248484 wikiPageExternalLink RNC3.pdf.
- Q7248484 wikiPageExternalLink parsePCF.sml.
- Q7248484 wikiPageWikiLink Q1079166.
- Q7248484 wikiPageWikiLink Q1189746.
- Q7248484 wikiPageWikiLink Q1208485.
- Q7248484 wikiPageWikiLink Q1725874.
- Q7248484 wikiPageWikiLink Q193076.
- Q7248484 wikiPageWikiLink Q21198.
- Q7248484 wikiPageWikiLink Q242028.
- Q7248484 wikiPageWikiLink Q2607208.
- Q7248484 wikiPageWikiLink Q2976255.
- Q7248484 wikiPageWikiLink Q49823.
- Q7248484 wikiPageWikiLink Q6134913.
- Q7248484 wikiPageWikiLink Q7036022.
- Q7248484 wikiPageWikiLink Q7134504.
- Q7248484 wikiPageWikiLink Q7134862.
- Q7248484 wikiPageWikiLink Q7467458.
- Q7248484 wikiPageWikiLink Q7782354.
- Q7248484 wikiPageWikiLink Q8161710.
- Q7248484 wikiPageWikiLink Q860654.
- Q7248484 wikiPageWikiLink Q865760.
- Q7248484 wikiPageWikiLink Q895815.
- Q7248484 wikiPageWikiLink Q92643.
- Q7248484 comment "In computer science, Programming Computable Functions, or PCF, is a typed functional language introduced in an unpublished 1969 manuscript 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.A fully abstract model for PCF was first given by Milner (1977). However, since Milner's model was essentially based on the syntax of PCF it was considered less than satisfactory (Ong, 1995).".
- Q7248484 label "Programming Computable Functions".