Programming Computable Functions: Difference between revisions

Revision as of 02:05, 28 March 2006

Revision as of 14:05, 22 July 2006

Line 1:

'''PCF''' or [[Programming language for Computable Functions]] is a typed [[Functional programming|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 programming language|ML]].

A [[fully abstract]] model for PCF was first given by [[Robin Milner|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).