ECOOP 2020
Mon 13 - Fri 17 July 2020 Berlin, Germany

ECOOP is Europe’s longest-standing annual Programming Languages (PL) conference, bringing together researchers, practitioners, and students to share their ideas and experiences in all topics related to programming languages, software development, object-oriented technologies, systems and applications. ECOOP welcomes high quality research papers relating to these fields in a broad sense.

This 34th edition of ECOOP will take place in July 2020 in Berlin, Germany. ECOOP is committed to affordable open-access publishing. Recent year’s publications have been published by Dagstuhl’s LIPIcs series under a Creative Commons CC BY license where the authors retain their copyright. ECOOP articles have been published without open-access publishing fee and can be accessed via a DOI. LIPIcs is indexed in DBLP, Google Scholar, Scopus and others.

Workshops: Call for Workshops

View track page for all details

To submit a proposal for an ECOOP workshop, please complete the online application form.

What’s new this year?

  • Sizes: we will have both half-day workshops and full-day workshops depending on organizer wishes and numbers of submissions.
  • Schedule: Workshop will follow a unified timeline. The submission deadline is 1 May 2020, and the notification deadline is 29 May 2020.
  • Rolling acceptances: ECOOP can accommodate up 14 workshops this year, submissions will be evaluated as they arrive (answers will be given within a week of submission).
  • Publication: ECOOP is held in-cooperation with SIGPLAN, workshop proceedings thus may be deposited in the ACM digital library. The workshop chair will provide contacts to the digital library, so that the organizers of each workshop can upload the papers and meta-data.

To organize a workshop we need to know (1) the name of the organizer(s), (2) the tentative program committee, (3) the estimated attendance, (4) the workshop’s name and topic.

Please contact the workshop co-chairs, Gregor Richards and Jan Vitek, if you have questions.