Programming Computable Functions

<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, Programming Computable Functions (PCF) is a <a href="/facts/Type_system/Tz0bAMS9">typed</a> <a href="/facts/Functional_programming/cdxqPEIM">functional language</a> introduced by <a href="/facts/Gordon_Plotkin/2CrnVkVj">Gordon Plotkin</a> in 1977, based on previous unpublished material by <a href="/facts/Dana_Scott/XEVddlVg">Dana Scott</a>. It can be considered to be an extended version of the <a href="/facts/Typed_lambda_calculus/g86GP4uK">typed lambda calculus</a> or a simplified version of modern typed functional languages such as <a href="/facts/ML_programming_language/RfwxASRF">ML</a> or <a href="/facts/Haskell_(programming_language)/4Htv9WLu">Haskell</a>.
</p><p>A <a href="/facts/Fully_abstract/yRs3ygRA">fully abstract</a> model for PCF was first given by <a href="/facts/Robin_Milner/oMfdsRwK">Robin Milner</a>. 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 <a href="/facts/Game_semantics/FJSuV3un">game semantics</a> and Kripke logical relations. 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.
</p>

Programming Computable Functions open-in-new

Programming Computable Functions