About: Programming Computable Functions

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Programming Computable Functions Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Language, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdf:type	language
rdfs:label	Programming Computable Functions (en)
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. (en)
sameAs	Programming Computable Functions Programming Computable Functions
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Short_description
Subject	Educational programming languages Programming language theory Programming languages created in 1977 Functional languages Academic programming languages
gold:hypernym	Language
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Programming_Computable_Functions?oldid=1056529198&ns=0
Wikipage page ID	3239232 (xsd:integer)
page length (characters) of wiki page	8257 (xsd:nonNegativeInteger)
Wikipage revision ID	1056529198 (xsd:integer)
has 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 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 (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, 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Programming_Computable_Functions
is Wikipage redirect of	Programming language for Computable Functions Programming with Computable Functions
is Link from a Wikipage to another Wikipage of	ALGOL Geometry of interaction Denotational semantics List of programming languages John C. Reynolds Game semantics Gordon Plotkin Let expression Logic of Computable Functions
is known for of	Gordon Plotkin

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software