Full Abstraction for PCF (extended abstract)

This publication has 14 references indexed in Scilit:

• Studying the fully abstract model of PCF within its continuous function model
  Published by Springer Nature ,1993
• Sequentiality and full abstraction
  Published by Cambridge University Press (CUP) ,1992
• Extensional embedding of a strongly stable model of PCF
  Published by Springer Nature ,1991
• Geometry of interaction 2: Deadlock-free algorithms
  Lecture Notes in Computer Science, 1990
• Geometry of Interaction 1: Interpretation of System F
  Published by Elsevier ,1989
• Towards a geometry of interaction
  Contemporary Mathematics, 1989
• Notes on Communicating Sequential Systems
  Published by Springer Nature ,1986
• Sequential algorithms on concrete data structures
  Theoretical Computer Science, 1982
• LCF considered as a programming language
  Theoretical Computer Science, 1977
• Fully abstract models of typed λ-calculi
  Theoretical Computer Science, 1977