1. S. Abramsky and G. McCusker . 1998. Call-by-Value Games . In Computer Science Logic: 11th International Workshop Proceedings (LNCS) , M. Nielsen and W. Thomas (Eds.). Springer , 1--17. S. Abramsky and G. McCusker. 1998. Call-by-Value Games. In Computer Science Logic: 11th International Workshop Proceedings (LNCS), M. Nielsen and W. Thomas (Eds.). Springer, 1--17.
2. M. Felleisen and D. Friedman. 1986. Control operators the SECD-machine and the λ-calculus. In Formal Description of Programming Concepts III M. Wirsing (Ed.). North-Holland 193--217. M. Felleisen and D. Friedman. 1986. Control operators the SECD-machine and the λ-calculus. In Formal Description of Programming Concepts III M. Wirsing (Ed.). North-Holland 193--217.
3. A. Filinski . 1996. Controlling Effects . Ph.D. Dissertation . School of Computer Science , Carnegie Mellon University , Pittsburgh, Pennsylvania . A. Filinski. 1996. Controlling Effects. Ph.D. Dissertation. School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania.
4. K. Honda and N. Yoshida . 1997. Game Theoretic Analysis of Call-by-Value Computation. In Automata, Languages and Programming , 24th International Colloquium (LNCS), P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela (Eds.) , Vol. 1256 . Springer, Bologna, Italy, 225--236. K. Honda and N. Yoshida. 1997. Game Theoretic Analysis of Call-by-Value Computation. In Automata, Languages and Programming, 24th International Colloquium (LNCS), P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela (Eds.), Vol. 1256. Springer, Bologna, Italy, 225--236.
5. On Full Abstraction for PCF: I, II, and III