PCF or Programming language for Computable Functions is a typed functional language introduced by Gordon Plotkin in 1977. It is based on the Logic of Computable Function (LCF) by Dana Scott. It can be considered as 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 Kripe logical relations (O'Hearn and Riecke, 1995).
External link
Sources
- Template:Journal reference
- Template:Journal reference
- Template:Journal reference
- http://users.comlab.ox.ac.uk/luke.ong/publications/index.html.
{{cite book}}: Missing or empty|title=(help); Unknown parameter|Author=ignored (|author=suggested) (help); Unknown parameter|Chapter=ignored (|chapter=suggested) (help); Unknown parameter|Editor=ignored (|editor=suggested) (help); Unknown parameter|Pages=ignored (|pages=suggested) (help); Unknown parameter|Publisher=ignored (|publisher=suggested) (help); Unknown parameter|Title=ignored (|title=suggested) (help); Unknown parameter|Year=ignored (|year=suggested) (help) - Template:Journal reference
 | This computing article is a stub. You can help Wikipedia by expanding it. |