Programming Language For Computable Functions Article Index for
Programming Language
Shopping
Functions
Website Links For
Programming
 

Information About

Programming Language For Computable Functions




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).


EXTERNAL LINK




SOURCES


  Author Abramsky, S, Jagadeesan, R, and Malacaria, P
  Title Full Abstraction for PCF
  Journal Information and Computation
  Date 2000
  Pages 409-470
  Volume 163
  Issue 2


  Author Hyland, J M E and Ong, C-H L
  Title On Full Abstraction for PCF
  Journal Information and Computation
  Date 2000
  Pages 285-408
  Volume 163
  Issue 2


  Author O'Hearn, P W and Riecke, J G
  Title Kripke Logical Relations and PCF
  Journal Information and Computation
  Date 1995
  Pages 107-116
  Volume 120
  Issue 1


  Author Plotkin, G D
  Title LCF considered as a programming language
  Journal Theoretical Computer Science
  Date 1977
  Pages 223-255
  Volume 5