| Programming Language For Computable Functions |
Article Index for Programming Language |
Shopping Functions |
Website Links For Programming |
Information AboutProgramming Language For Computable Functions |
| CATEGORIES ABOUT PROGRAMMING LANGUAGE FOR COMPUTABLE FUNCTIONS | |
| programming languages | |
|
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. EXTERNAL LINK SOURCES
|
|
|