Publisher
Springer International Publishing
Reference63 articles.
1. Abramsky, S. (2003). Sequentiality vs. concurrency in games and logic. Mathematical Structures in Computer Science, 13(4), 531–565.
2. Abramsky, S., & Jagadeesan, R. (1992). Games and full completeness for multiplicative linear logic (extended abstract). In Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18–20, 1992 (pp. 291–301).
3. Abramsky, S., Jagadeesan, R., & Malacaria, P. (2000). Full abstraction for PCF. Information and Computation, 163(2), 409–470.
4. Abramsky, S., & McCusker, G. (1997). Call-by-value games. In Computer Science Logic, 11th International Workshop, CSL ’97, Annual Conference of the EACSL, Aarhus, Denmark, August 23–29, 1997, Selected Papers (pp. 1–17).
5. Abramsky, S., & Melliès, P. (1999). Concurrent games and full completeness. In 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2–5, 1999 (pp. 431–442).