Full Abstraction for PCF1

[1]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[2]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[3]  Samson Abramsky,et al.  Proofs as Processes , 1992, Theor. Comput. Sci..

[4]  Peter W. O'Hearn,et al.  Kripke Logical Relations and PCF , 1995, Inf. Comput..

[5]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[6]  Roy L. Crole,et al.  Categories for Types , 1994, Cambridge mathematical textbooks.

[7]  Jean-Yves Girard,et al.  Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.

[8]  Martín Abadi,et al.  A PER model of polymorphism and recursive types , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[9]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[10]  Antonio Bucciarelli,et al.  Extensional Embedding of a Strongly Stable Model of PCF , 1991, ICALP.

[11]  Samson Abramsky.  Games in the Semantics of Programming Languages , 1997 .

[12]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[13]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[14]  P.-L. Curien.  Applications of Categories in Computer Science: Sequentiality and full abstraction , 1992 .

[15]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[16]  Radha Jagadeesan,et al.  Game semantics for exponentials , 1993 .

[17]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[18]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[19]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[20]  Matthias Felleisen,et al.  Observable sequentiality and full abstraction , 1992, POPL '92.

[21]  K. Mulmuley.  Full Abstraction and Semantic Equivalence , 1987 .

[22]  Hanno Nickau.  Hereditarily Sequential Functionals , 1994, LFCS.

[23]  Alley Stoughton,et al.  Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[24]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[25]  Alley Stoughton,et al.  Studying the Fully Abstract Model of PCF within its Continuous Function Model , 1993, TLCA.