Alonzo Church Award

An annual award, called the Alonzo Church Award for Outstanding Contributions to Logic and Computation, was established in 2015 by the ACM Special Interest Group for Logic and Computation (SIGLOG), the European Association for Theoretical Computer Science (EATCS) the European Associationfor Computer Science Logic (EACSL), and the Kurt Goedel Society (KGS) (referred to below as the four “Sponsoring Organizations”). From 2023, the Alonzo Church Award, is sponsored by (in alphabetic order) EACSL, EATCS, and SIGLOG. The award is for an outstanding contribution represented by a paper or small group of papers within the past 25 years. This time span allows  the  contribution to have established evidence of lasting impact and depth. The award can be given to an individual or a group of individuals who have collaborated on the research.

Eligibility and Nominations
The basic eligibility criterion is that the contribution has appeared in a paper or papers within the past 25 years. When a paper has appeared in a conference and then in a journal, the date of the journal publication will determine the cut - off date. Thus, for the first award, which is planned to be presented in summer 2016, the cut-off date would be 1st January 1991. In addition, the contribution(s) should not yet have received recognition via a major award, such as the Turing Award, the Kanellakis Award, or the Goedel Prize. (The nominee(s) may have received such awards for other contributions.)
While the contribution can consist of either conference or journal papers, journal papers will be given a preference. Decisions about eligibility are in the purview of the Award Committee.
Nominations will be solicited through the newsletters, bulletins, mailing lists, social networks, and websites of the sponsoring organizations and through publicity flyers at major conferences.
The nominating letter must summarize the contribution and make the case for why it is outstanding. The nominating letter can have multiple  co-signers. Self-nominations are excluded. A nomination must state clearly the contribution, explain why the contribution is fundamental  and  outstanding, and may be accompanied by supporting letters and other evidence of worthiness. Nominations must include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination.
The award will be given for intellectual depth, novelty, and impact.
The award will be selected by the Award Committee from the submitted nominations by consensus, following the Ground Rules for Award - Committee Decision Making by ACM Awards Committee. If the Award Committee does not select any nomination, then no award will be made in the given year. The Award Committee shall  provide a detailed citation that explains the basis of the award. The Award Committee shall take into account all individuals who have contributed to an awarded accomplishment, as well as independent discoveries of an awarded contribution, and assure that all individuals are treated fairly. In particular, the Award Committee can select a nomination, but change the set of selected  individuals.
The Committee must follow the Guidelines on Conflict-of-Interest by ACM Awards Committee.


Presentation of the Award
The award will be given annually and will be presented in turnat LICS, CSL, and ICALP, which are the flagship conferences of SIGLOG, EACSL, and EATCS, respectively.
The award will be accompaniedby an invited lecture by the award winner or one of  the award winners at the conference where the award will be presented. The awardee(s) will receive a certificate and a cash prize of USD1,500. If there are multiple awardees, this amount will be shared. The award will be covered by the operating expenses of the sponsoring organizations. The individual conference organization will cover the travel and other expenses for one of the award winners to present the invited talk. Each of the sponsoring organizations will contribute USD500 every year for the award honorarium.


Award Committee
The Church Award Committee will consist of five members appointed by EACSL, EATCS, and SIGLOG. The appointments should be coordinated to strive for multi-dimensional diversity of the Committee, as well as to provide broad coverage of expertise across different research areas. A member of the Award Committee will serve for five years, with one member retiring every year. (There will be an initial transient period with an accelerated retirement schedule; see below.).

Members of the Award
Members of the Award Committee are not eligible to receive the Award during their service on the Committee. Officers of the sponsoring organizations are not eligible to serve on the Award Committee. The four positions on the Award Committee are referred to as 1, 2, 3, 4 and 5. The Sponsoring Organizations will appoint the members of first Award Committee to specific positions. The tenure of a member in position n shall be n years. In respective subsequent years, the member in position 1 shall retire from the Committee, the member in position n (n > 1) shall assume position n-1, and a new member shall be appointed by the Sponsoring Organizations for position 5. The Sponsoring Organizations shall take turns in appointing new members, to ensure a fair representation on the Award Committee according to the schedule specified below. In the event of an unanticipated vacancy on the Award Committee, the Sponsoring Organizations shall appoint a new member to the vacated position.

The Committee shall be chaired by the member in position 2. Thus, after serving as a chair, a member serves one additional year and then retires. The chair is responsible for publicizing the request for nominations, receiving nominations and distributing them to members of the Award Committee, and overseeing the selection processes.

For the 2019 Committee, the positions are appointed as follows:

(1) EATCS (2) SIGLOG (3) EACSL (4) EATCS and (5) SIGLOG. In 2020 the new member will be appointed by EACSL and in 2021 by EATCS; thereafter this pattern will repeat.

Oversight of the Award will be done by the SIGLOG Awards  Chair, who is responsible for

  • keeping track of Committee membership, announcement materials, timelines, and the like,
  • reminding the Sponsoring Organizations w hen it is their turn to name a new member of the Award Committee
  • contacting the new chair of the Award Committee every year by October 1 to go over the Award rules,
  • monitoring Committee’s work progress, and
  • coordinating with the Sponsoring Organizations.

Any circumstances that are unaccounted for through the above process shall be resolved by the Sponsoring Organizations through the coordination of the SIGLOG Awards Chair. This set of rules can be changed by the Sponsoring Organizations.

2023 / Paderborn, Germany

  • Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, Derek Dreyer: “Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning”. POPL 2015.
  • Ralf Jung, Robbert Krebbers, Lars Birkedal, Derek Dreyer: “Higher-order ghost state”. ICFP 2016.
  • Robbert Krebbers, Ralf Jung, Aleš Bizjak, Jacques-Henri Jourdan, Derek Dreyer, Lars Birkedal: “The Essence of Higher-Order Concurrent Separation Logic”. ESOP 2017.
  • Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Aleš Bizjak, Lars Birkedal, Derek Dreyer: “Iris from the ground up: A modular foundation for higher-order concurrent separation logic”. J. Funct. Program. 28 (2018).

2022 / Haifa, Israel

  • Dexter Kozen. "Kleene Algebra with Tests". ACM Transactions on Programming Languages and Systems 19(3): 427-443 (1997)

2021 / Rome, Italy

  • Georg Gottlob and Christoph Koch. “Monadic Datalog and the Expressive Power of Lan- guages for Web Information Extraction.” Journal of the ACM (JACM) 51.1 (2004): 74-113.
  • Georg Gottlob, Christoph Koch, and Klaus U. Schulz. “Conjunctive Queries Over Trees.” Journal of the ACM (JACM) 53.2 (2006): 238-272.
  • Georg Gottlob, Christoph Koch, and Reinhard Pichler. “Efficient Algorithms for Processing XPath Queries.” ACM Transactions on Database Systems (TODS) 30.2 (2005): 444-491.
  • Georg Gottlob, Christoph Koch, Reinhard Pichler, and Luc Segoufin. “The Complexity of XPath Query Evaluation and XML Typing.” Journal of the ACM (JACM) 52.2 (2005): 284-335.

2020 / Ljubljana, Slovenia

  • Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Renée J. Miller. Data exchange: Semantics and Query Answering, Proceedings of the 9th International Conference on Database Theory (ICDT 2003), pp. 207-223, 2003.
    Full journal version: Theoretical Computer Science, Vol. 336, No. 1, pp. 89-124, 2005.
  • Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. Composing Schema Mappings: Second-Order Dependencies to the Rescue, Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2004), pp. 83-94, 2004.
    Full journal version: ACM Transactions on Database Systems, Vol. 30, No. 4, pp. 994-1055, 2005.

2019 / Patras, Greece

  • Murdoch J. Gabbay and Andrew M. Pitts. A new approach to abstract syntax with variable binding, Formal Aspects of Computing 13(3):341– 363, 2002.
  • Andrew M. Pitts. Nominal logic, a first order theory of names and binding, Information and Computation 186(2):165–193, 2003.

2018 / Oxford, UK

  • Tomas Feder, Moshe Y. Vardi: Monotone Monadic SNP and Constraint Satisfaction. STOC 1993, 612-622.
  • Tomas Feder, Moshe Y. Vardi: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM J. Comput. 28(1), 57–104 (1998).

2017 / Stockholm, Sweden

  • S. Abramsky, R. Jagadeesan, and P. Malacaria. Full Abstraction for PCF. Information and Computation, Vol. 163, No. 2, pp. 409-470, 2000.
  • J.M.E. Hyland and C.-H.L. Ong. On Full Abstraction for PCF: I, II, and III. Information and Computation, Vol. 163, No. 2, pp. 285-408, 2000.
  • H. Nickau. Hereditarily sequential functionals. Proc. Symp. Logical Foundations of Computer Science: Logic at St. Petersburg (eds. A. Nerode and Yu.V. Matiyasevich), Lecture Notes in Computer Science, Vol. 813, pp. 253-264. Springer-Verlag, 1994.

2016 / New York, USA your social media marketing partner
European Association for Theoretical Computer Science - Maintained and hosted by RU1 / CTI.