The 2017 Alonzo Church award

SIGLOG is delighted to announce that the 2017 Church Award goes to 6 people: Samson Abramsky, Martin Hyland, Radha Jagadeesan, Pasquale Malacaria, Hanno Nickau and Luke Ong for [Quoting from the official citation] "providing a fully-abstract semantics for higher-order computation through the introduction of games models, thereby fundamentally revolutionising the field of programming language semantics, and for the applied impact of these models."

[1]  Dan R. Ghica,et al.  Reasoning about Idealized ALGOL Using Regular Languages , 2000, ICALP.

[2]  Nobuko Yoshida,et al.  Game-Theoretic Analysis of Call-by-Value Computation , 1997, Theor. Comput. Sci..

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

[4]  Samson Abramsky,et al.  From CSP to Game Semantics , 2010, Reflections on the Work of C. A. R. Hoare.

[5]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[6]  Joël Ouaknine,et al.  APEX: An Analyzer for Open Probabilistic Programs , 2012, CAV.

[7]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[8]  James Laird.  A fully abstract game semantics of local exceptions , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[9]  Andrzej S. Murawski,et al.  Applying Game Semantics to Compositional Software Modeling and Verification , 2004, TACAS.

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

[11]  R. O. Gandy.  Computable Functionals of Finite Type I , 1967 .

[12]  S. C. Kleene.  Recursive functionals and quantifiers of finite types revisited. V , 1991 .

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

[14]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 2000, Inf. Comput..

[15]  Tom Hirschowitz,et al.  Innocent Strategies as Presheaves and Interactive Equivalences for CCS , 2011, Sci. Ann. Comput. Sci..

[16]  Dan R. Ghica,et al.  Abstract Machines for Game Semantics, Revisited , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

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

[18]  Aleksandar Dimovski,et al.  Software Model Checking Based on Game Semantics and CSP , 2005, AVoCS.

[19]  Andrzej S. Murawski,et al.  An invitation to game semantics , 2016, SIGL.

[20]  Andrew W. Appel,et al.  Compositional CompCert , 2015, POPL.

[21]  Samson Abramsky.  Linearity‚ Sharing and State: a fully abstract game semantics for Idealized Algol , 1997 .

[22]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[23]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[24]  Dan R. Ghica,et al.  Geometry of synthesis III: resource management through type inference , 2011, POPL '11.

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

[26]  Russell Harmer,et al.  A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[27]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[28]  Naoki Kobayashi,et al.  Model Checking Higher-Order Programs , 2013, JACM.

[29]  Ralph Loader.  Finitary PCF is not decidable , 2001, Theor. Comput. Sci..

[30]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[31]  Naoki Kobayashi,et al.  An Intersection Type System for Deterministic Pushdown Automata , 2012, IFIP TCS.

[32]  Kuno Lorenz,et al.  basic objectives of dialogue logic in historical perspective , 2001, Synthese.

[33]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.

[34]  C.-H. Luke Ong,et al.  A traversal-based algorithm for higher-order model checking , 2012, ICFP '12.

[35]  Dan R. Ghica,et al.  Slot games: a quantitative model of computation , 2005, POPL '05.

[36]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[37]  R. Platek.  Foundations of recursion theory , 1966 .

[38]  Zhong Shao,et al.  A Compositional Semantics for Verified Separate Compilation and Linking , 2015, CPP.

[39]  Guy McCusker.  Games and Full Abstraction for FPC , 2000, Inf. Comput..

[40]  James Laird,et al.  Full abstraction for functional languages with control , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[41]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[42]  Tom Hirschowitz,et al.  Fully-abstract concurrent games for pi , 2013, ArXiv.

[43]  James Laird.  A Game Semantics of the Asynchronous pi-Calculus , 2005, CONCUR.

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