2021-08-30

[Caml-list] IFL'21 final call for participation

================================================================================

 

                                IFL 2021

 

    33rd Symposium on Implementation and Application of Functional Languages

 

 

                             venue: online

                          1 - 3 September 2021

 

                         https://ifl21.cs.ru.nl

 

 

Registration


Registration is free of charge, but required for participation! We will mail the zoom link only to registered participants. Use the below link to register for IFL 2021:

 

https://docs.google.com/forms/d/e/1FAIpQLSdMFjo-GumKjk4i7szs7n4DhWqKt96t8ofIqshfQFrf4jnvsA/viewform?usp=sf_link

 

Program

The program is now available at https://ifl21.cs.ru.nl/Program.


Scope

The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming.

 

Organisation

IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands

IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands

 

PC

Peter Achten (co-chair)   - Radboud University, Netherlands

Thomas van Binsbergen     - University of Amsterdam, Netherlands

Edwin Brady               - University of St. Andrews, Scotland

Laura Castro              - University of A Coruña, Spain

Youyou Cong               - Tokyo Institute of Technology, Japan

Olaf Chitil               - University of Kent, England

Andy Gill                 - University of Kansas, USA

Clemens Grelck            - University of Amsterdam, Netherlands

John Hughes               - Chalmers University, Sweden

Pieter Koopman (co-chair) - Radboud University, Netherlands

Cynthia Kop               - Radboud University, Netherlands

Jay McCarthey             - University of Massachussetts Lowell, USA

Neil Mitchell             - Facebook, England

Jan De Muijnck-Hughes     - Glasgow University, Scotland

Keiko Nakata              - SAP Innovation Center Potsdam, Germany

Jurriën Stutterheim       - Standard Chartered, Singapore

Simon Thompson            - University of Kent, England

Melinda Tóth              - Eötvos Loránd University, Hungary

Phil Trinder              - Glasgow University, Scotland

Meng Wang                 - University of Bristol, England

Viktória Zsók             - Eötvos Loránd University, Hungary

beacon

2021-08-25

[Caml-list] IFL'21 call for participation

================================================================================

 

                                IFL 2021

 

    33rd Symposium on Implementation and Application of Functional Languages

 

 

                             venue: online

                          1 - 3 September 2021

 

                         https://ifl21.cs.ru.nl

 

 

Registration


Registration is free of charge, but required for participation! Use the below link to register for IFL 2021:

 

https://docs.google.com/forms/d/e/1FAIpQLSdMFjo-GumKjk4i7szs7n4DhWqKt96t8ofIqshfQFrf4jnvsA/viewform?usp=sf_link

 

Scope


The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming.

 

Program

The program is now available at https://ifl21.cs.ru.nl/Program.

 

Organisation

IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands

IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands

 

PC

Peter Achten (co-chair)   - Radboud University, Netherlands

Thomas van Binsbergen     - University of Amsterdam, Netherlands

Edwin Brady               - University of St. Andrews, Scotland

Laura Castro              - University of A Coruña, Spain

Youyou Cong               - Tokyo Institute of Technology, Japan

Olaf Chitil               - University of Kent, England

Andy Gill                 - University of Kansas, USA

Clemens Grelck            - University of Amsterdam, Netherlands

John Hughes               - Chalmers University, Sweden

Pieter Koopman (co-chair) - Radboud University, Netherlands

Cynthia Kop               - Radboud University, Netherlands

Jay McCarthey             - University of Massachussetts Lowell, USA

Neil Mitchell             - Facebook, England

Jan De Muijnck-Hughes     - Glasgow University, Scotland

Keiko Nakata              - SAP Innovation Center Potsdam, Germany

Jurriën Stutterheim       - Standard Chartered, Singapore

Simon Thompson            - University of Kent, England

Melinda Tóth              - Eötvos Loránd University, Hungary

Phil Trinder              - Glasgow University, Scotland

Meng Wang                 - University of Bristol, England

Viktória Zsók             - Eötvos Loránd University, Hungary

beacon

2021-08-18

[Caml-list] Certified Programs and Proofs (CPP) 2022: Final Call for Papers

Certified Programs and Proofs (CPP) is an international conference on
practical and theoretical topics in all areas that consider formal
verification and certification as an essential paradigm for their
work. CPP spans areas of computer science, mathematics, logic, and
education.

CPP 2022 (https://urldefense.com/v3/__https://popl22.sigplan.org/home/CPP-2022__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsP9p4dj8$ ) will be held on
17-18 January 2022 and will be co-located with POPL 2022 in
Philadelphia, Pennsylvania, United States. CPP 2022 is sponsored by
ACM SIGPLAN, in cooperation with ACM SIGLOG.

CPP 2022 will welcome contributions from all members of the community.
The CPP 2022 organizers will strive to enable both in-person and
remote participation, in cooperation with the POPL 2022 organizers.

NEWS

If the authors of a CPP 2022 accepted paper will be unable or
unwilling to travel to the conference, the organizers can confirm that
this will not affect the paper's publication in the proceedings, and
the authors will be able to upload recorded talks that will be made
publicly available.

IMPORTANT DATES

* Abstract Submission Deadline: 16 September 2021 at 23:59 AoE (UTC-12h)
* Paper Submission Deadline: 22 September 2021 at 23:59 AoE (UTC-12h)
* Notification (tentative): 22 November 2021
* Camera Ready Deadline (tentative): 12 December 2021
* Conference: 17-18 January 2022

Deadlines expire at the end of the day, anywhere on earth. Abstract
and submission deadlines are strict and there will be no extensions.

DISTINGUISHED PAPER AWARDS

Around 10% of the accepted papers at CPP 2022 will be designated as
Distinguished Papers. This award highlights papers that the CPP
program committee thinks should be read by a broad audience due to
their relevance, originality, significance and clarity.

TOPICS OF INTEREST

We welcome submissions in research areas related to formal
certification of programs and proofs. The following is a
non-exhaustive list of topics of interest to CPP:
* certified or certifying programming, compilation, linking, OS
kernels, runtime systems, security monitors, and hardware;
* certified mathematical libraries and mathematical theorems;
* proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light,
Idris, Isabelle, Lean, Mizar, Nuprl, PVS, etc);
* new languages and tools for certified programming;
* program analysis, program verification, and program synthesis;
* program logics, type systems, and semantics for certified code;
* logics for certifying concurrent and distributed systems;
* mechanized metatheory, formalized programming language semantics,
and logical frameworks;
* higher-order logics, dependent type theory, proof theory, logical
systems, separation logics, and logics for security;
* verification of correctness and security properties;
* formally verified blockchains and smart contracts;
* certificates for decision procedures, including linear algebra,
polynomial systems, SAT, SMT, and unification in algebras of interest;
* certificates for semi-decision procedures, including equality,
first-order logic, and higher-order unification;
* certificates for program termination;
* formal models of computation;
* mechanized (un)decidability and computational complexity proofs;
* formally certified methods for induction and coinduction;
* integration of interactive and automated provers;
* logical foundations of proof assistants;
* applications of AI and machine learning to formal certification;
* user interfaces for proof assistants and theorem provers;
* teaching mathematics and computer science with proof assistants.

SUBMISSION GUIDELINES

Prior to the paper submission deadline, the authors should upload
their anonymized paper in PDF format through the HotCRP system at

https://urldefense.com/v3/__https://cpp2022.hotcrp.com__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHs8-hvWck$

The submissions must be written in English and provide sufficient
detail to allow the program committee to assess the merits of the
contribution. They must be formatted following the ACM SIGPLAN
Proceedings format using the acmart style with the sigplan option,
which provides a two-column style, using 10 point font for the main
text, and a header for double blind review submission, i.e.,

\documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false}

The submitted papers should not exceed 12 pages, including tables and
figures, but excluding bibliography and clearly marked appendices. The
papers should be self-contained without the appendices. Shorter papers
are welcome and will be given equal consideration. Submissions not
conforming to the requirements concerning format and maximum length
may be rejected without further consideration.

CPP 2022 will employ a lightweight double-blind reviewing process. To
facilitate this, the submissions must adhere to two rules:
(1) author names and institutions must be omitted, and
(2) references to authors' own related work should be in the third
person (e.g., not "We build on our previous work ..." but rather "We
build on the work of ...").

The purpose of this process is to help the PC and external reviewers
come to an initial judgment about the paper without bias, not to make
it impossible for them to discover the authors if they were to try.
Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing it more difficult. In
particular, important background references should not be omitted or
anonymized. In addition, authors are free to disseminate their ideas
or draft versions of their papers as usual. For example, authors may
post drafts of their papers on the web or give talks on their research
ideas. POPL has answers to frequently asked questions addressing many
common concerns:
https://urldefense.com/v3/__https://popl20.sigplan.org/track/POPL-2020-Research-Papers*Submission-and-Reviewing-FAQ__;Iw!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHseMvit9g$

We strongly encourage the authors to provide any supplementary
material that supports the claims made in the paper, such as proof
scripts or experimental data. This material must be uploaded at
submission time, as an archive, not via a URL. Two forms of
supplementary material may be submitted:
(1) Anonymous supplementary material is made available to the
reviewers before they submit their first-draft reviews.
(2) Non-anonymous supplementary material is made available to the
reviewers after they have submitted their first-draft reviews and have
learned the identity of the authors.

Please use anonymous supplementary material whenever possible, so that
it can be taken into account from the beginning of the reviewing
process.

The submitted papers must adhere to the SIGPLAN Republication Policy
(https://urldefense.com/v3/__https://www.sigplan.org/Resources/Policies/Republication/__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHskK93Bcs$ ) and the
ACM Policy on Plagiarism
(https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsq444C5s$ ). Concurrent
submissions to other conferences, journals, workshops with
proceedings, or similar forums of publication are not allowed. The PC
chairs should be informed of closely related work submitted to a
conference or journal in advance of submission. One author of each
accepted paper is expected to present it at the (possibly virtual)
conference.

PUBLICATION, COPYRIGHT AND OPEN ACCESS

The CPP 2022 proceedings will be published by the ACM, and authors of
accepted papers will be required to choose one of the following
publication options:
(1) Author retains copyright of the work and grants ACM a
non-exclusive permission-to-publish license and, optionally, licenses
the work under a Creative Commons license.
(2) Author retains copyright of the work and grants ACM an exclusive
permission-to-publish license.
(3) Author transfers copyright of the work to ACM.

For authors who can afford it, we recommend option (1), which will
make the paper Gold Open Access, and also encourage such authors to
license their work under the CC-BY license. ACM will charge you an
article processing fee for this option (currently, US$700), which you
have to pay directly with the ACM.

For everyone else, we recommend option (2), which is free and allows
you to achieve Green Open Access, by uploading a preprint of your
paper to a repository that guarantees permanent archival such as arXiv
or HAL. This is anyway a good idea for timely dissemination even if
you chose option 1. Ensuring timely dissemination is particularly
important for this edition, since, because of the very tight schedule,
the official proceedings might not be available in time for CPP.

The official CPP 2022 proceedings will also be available via SIGPLAN
OpenTOC (https://urldefense.com/v3/__http://www.sigplan.org/OpenTOC/*cpp__;Iw!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsMAhUWgk$ ).

For ACM's take on this, see their Copyright Policy
(https://urldefense.com/v3/__http://www.acm.org/publications/policies/copyright-policy__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsOw_JuVs$ ) and Author
Rights (https://urldefense.com/v3/__http://authors.acm.org/main.html__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsEFy0nQE$ ).

PROGRAM COMMITTEE

Andrei Popescu, University of Sheffield, United Kingdom (co-chair)
Steve Zdancewic, University of Pennsylvania, United States (co-chair)
Mohammad Abdulaziz, TU München, Germany
Mauricio Ayala-Rincón, Universidade de Brasília, Brazil
Andrej Bauer, University of Ljubljana, Slovenia
Thomas Bauereiss, University of Cambridge, United Kingdom
Yves Bertot, Inria and Université Cote d'Azur, France
Lars Birkedal, Aarhus University, Denmark
Sylvie Boldo, Inria and Université Paris-Saclay, France
Qinxiang Cao, Shanghai Jiao Tong University, China
Évelyne Contejean, Laboratoire Méthodes Formelles, CNRS, France
Benjamin Delaware, Purdue University, United States
Simon Foster, University of York, United Kingdom
Alwyn Goodloe, NASA Langley Research Center, United States
Armaël Guéneau, Aarhus University, Denmark
John Harrison, Amazon Web Services, United States
Joe Hendrix, Galois, Inc, United States
Aquinas Hobor, National University of Singapore, Singapore
Ralf Jung, MPI-SWS, Germany
Cezary Kaliszyk, University of Innsbruck, Austria
Jeehoon Kang, KAIST, South Korea
Hongjin Liang, Nanjing University, China
Gregory Malecha, BedRock Systems, Inc, United States
Anders Mörtberg, Stockholm University, Sweden
Toby Murray, University of Melbourne, Australia
Zoe Paraskevopoulou , Northeastern University, United States
Brigitte Pientka, McGill University, Canada
Aseem Rastogi, Microsoft Research, India
Bas Spitters, Aarhus University, Denmark
Kathrin Stark, Princeton University, United States
Hira Taqdees Syeda, Chalmers University of Technology, Sweden
Joseph Tassarotti, Boston College, United States
Laura Titolo, NIA/NASA LaRC, United States
Sophie Tourret, Inria, France
Dmitriy Traytel, University of Copenhagen, Denmark
Floris van Doorn, Paris-Saclay University, France
Freek Verbeek, Open University of The Netherlands, Netherlands
Freek Wiedijk, Radboud Universiteit Nijmegen, Netherlands

ORGANIZERS

Lennart Beringer, Princeton University, United States (conference co-chair)
Robbert Krebbers, Radboud University, Netherlands (conference co-chair)
Andrei Popescu, University of Sheffield, United Kingdom (PC co-chair)
Steve Zdancewic, University of Pennsylvania, United States (PC co-chair)

CONTACT

For any questions please contact the two PC chairs:
Andrei Popescu<a.popescu@sheffield.ac.uk>
Steve Zdancewic<stevez@seas.upenn.edu>

2021-08-17

[Caml-list] Attn: Development Editor, Latest OCaml Weekly News

OCaml Weekly News

Previous Week Up Next Week

Hello

Here is the latest OCaml Weekly News, for the week of August 10 to 17, 2021.

http-multipart-formdata v3.0.1 released

Continuing the thread from last week, Hannes Mehnert asked

Thanks for your work on that. I'm curious about the different "multipart" libraries now available for OCaml – anyone has a brief comparison of them?

Are there functional differences? Correctness? Performance? Or just a matter of style and co-development?

Bikal Lem replied

One obvious difference among the three is http-multipart-formdata doesn't depend on any IO/Promise libraries, such as lwt or async. so you may find it easier to integrate in your project.

mulitpart-form-data exposes a callback based streaming api, whereas http-multipart-formdata exposes a non-callback, non-blocking based API streaming api.

The API surface of http-multipart-formdata is kept as low as possible, primarily 3 API calls - boundary, reader and read call.

The dependency list of http-multipart-formdata is the thinnest. This may or may not be an issue depending on your aesthetics. However, relatively/comparatively the less your dependencies, the easier it is to integrate the lib with other OCaml libs and environments such as various OSes.

Bikal Lem added

I should also add http-multipart-formdata has been implemented with zero-copy streaming and minimal allocation in mind.

Call for participation: ML Family Workshop 2021

Jonathan Protzenko announced

We are happy to announce that the ML Family Workshop is back for its 2021 edition, which we will be held online on Thursday August 26th, in conjunction with ICFP 2021. We invite you to subscribe to, and attend the workshop, in addition to the main ICFP conference.

We are thrilled to announce that Don Syme will give this year's keynote: "Narratives and Lessons from The Early History of F#". Please join us!

The program features 14 exciting submissions, including 4 short talks. The workshop will be held online in the 6pm-3am time band (Seoul Time). Talks will be pre-recorded and uploaded online for those who cannot attend.

Program committee

  • Danel Ahman (University of Ljubljana)
  • Robert Atkey (University of Strathclyde)
  • Frédéric Bour (Tarides)
  • Ezgi Çiçek (Facebook London)
  • Youyou Cong (Tokyo Institute of Technology)
  • Richard A. Eisenberg (Tweag I/O)
  • Martin Elsman (University of Copenhagen, Denmark)
  • Ohad Kammar (University of Edinburgh)
  • Naoki Kobayashi (University of Tokyo, Japan)
  • Benoît Montagu (Inria)
  • Jonathan Protzenko (Microsoft Research) (Chair)
  • Kristina Sojakova (INRIA Paris)
  • Don Syme (Microsoft)
  • Matías Toro (University of Chile)
  • Katsuhiro Ueno (Tohoku University)

Coq-of-ocaml to translate OCaml to Coq

Guillaume Claret announced

I am pleased to present the coq-of-ocaml project, to translate a subset of OCaml to the Coq proof assistant. The aim is to do formal verification on OCaml programs. The idea is to generate a Coq translation as close as possible to the original code in terms of intent but using the Coq syntax. As a short example, if we take the following OCaml code and run coq-of-ocaml:

type 'a tree =  | Leaf of 'a  | Node of 'a tree * 'a tree    let rec sum tree =    match tree with    | Leaf n -> n    | Node (tree1, tree2) -> sum tree1 + sum tree2  

we get the following Coq file:

Require Import CoqOfOCaml.CoqOfOCaml.  Require Import CoqOfOCaml.Settings.    Inductive tree (a : Set) : Set :=  | Leaf : a -> tree a  | Node : tree a -> tree a -> tree a.    Arguments Leaf {_}.  Arguments Node {_}.    Fixpoint sum (tree : tree int) : int :=    match tree with    | Leaf n => n    | Node tree1 tree2 => Z.add (sum tree1) (sum tree2)    end.  

We support the following OCaml features:

  • the core of OCaml (functions, let bindings, pattern-matching,…)
  • type definitions (records, inductive types, synonyms, mutual types)
  • monadic programs
  • modules as namespaces
  • modules as polymorphic records (signatures, functors, first-class modules)
  • multiple-file projects (thanks to Merlin)
  • both .ml and .mli files
  • existential types (we use impredicative sets option in Coq)

We also have some support for the GADTs, the polymorphic variants, and the extensible types. We are in particular working on having an axiom-free translation of the GADTs to Coq. We do not support:

  • side-effects outside of a monad (references, exceptions, …);
  • object-oriented programming;
  • various combinations of OCaml features for which coq-of-ocaml should generate a warning.

Our main example and use case is the coq-tezos-of-ocaml project. This contains a translation of most of the economic protocol of the Tezos blockchain (around 30.000 lines of OCaml translated to 40.000 lines of Coq). For example, we verify the comparison functions defined in src/proto_alpha/lib_protocol/script_comparable.ml with src/Proto_alpha/Proofs/Script_comparable.v.

We are looking for the application to other projects too.

We think the best way to use coq-of-ocaml is to continue developing in OCaml and run coq-of-ocaml to keep a synchronized translation in Coq. Having a working Coq translation (as compiling in Coq) forces us to avoid some OCaml constructs. We believe these constructs would probably be hard to verify anyway. Then, on the Coq side, we can verify some important or easy to catch properties. If there is a regression in the OCaml code, re-running coq-of-ocaml should make the proofs break.

Old CWN

If you happen to miss a CWN, you can send me a message and I'll mail it to you, or go take a look at the archive or the RSS feed of the archives.

If you also wish to receive it every week by mail, you may subscribe online.

2021-08-11

[Caml-list] Call for participation: ML Family Workshop 2021

We are happy to announce that the ML Family Workshop is back for its
2021 edition, which we will be held online on Thursday August 26th, in
conjunction with ICFP 2021. We invite you to subscribe to, and attend
the workshop, in addition to the main ICFP conference.

We are thrilled to announce that Don Syme will give this year's keynote:
"Narratives and Lessons from The Early History of F#". Please join us!

The program features 14 exciting submissions, including 4 short talks.
The workshop will be held online in the 6pm-3am time band (Seoul Time).
Talks will be pre-recorded and uploaded online for those who cannot attend.

* Program: https://icfp21.sigplan.org/home/mlfamilyworkshop-2021#program
* Keynote:
https://icfp21.sigplan.org/details/mlfamilyworkshop-2021-papers/15/Keynote-Narratives-and-Lessons-from-The-Early-History-of-F-
* ICFP home: http://icfp21.sigplan.org/home

## Program committee

Danel Ahman (University of Ljubljana)
Robert Atkey (University of Strathclyde)
Frédéric Bour (Tarides)
Ezgi Çiçek (Facebook London)
Youyou Cong (Tokyo Institute of Technology)
Richard A. Eisenberg (Tweag I/O)
Martin Elsman (University of Copenhagen, Denmark)
Ohad Kammar (University of Edinburgh)
Naoki Kobayashi (University of Tokyo, Japan)
Benoît Montagu (Inria)
Jonathan Protzenko (Microsoft Research) (Chair)
Kristina Sojakova (INRIA Paris)
Don Syme (Microsoft)
Matías Toro (University of Chile)
Katsuhiro Ueno (Tohoku University)

2021-08-06

[Caml-list] Call for Participation: ICFP 2021

=====================================================================

Call for Participation

ICFP 2021
26th ACM SIGPLAN International Conference on Functional Programming
and affiliated events

August 22 - August 27, 2021
Online
http://icfp21.sigplan.org/

Early Registration until August 7!

=====================================================================

ICFP provides a forum for researchers and developers to hear
about the latest work on the design, implementations, principles, and
uses of functional programming. The conference covers the entire
spectrum of work, from practice to theory, including its peripheries.

This year, the conference will be a virtual event. All activities will
take place online.

The main conference will take place from August 23-25, 2021 during two
time bands. The first band will be 4PM-11PM Seoul time, and will
include both technical and social activities. The second band will
repeat (with some variation) the technical program and social
activities 12 hours later, 3PM-10PM New York, the following day.

We're excited to announce that ICFP 2021 will feature an invited talk
from Ravi Chugh of the University of Chicago. Keynote sessions will
take place at 10 PM Seoul/9 AM New York.

ICFP has officially accepted 35 exciting papers, and (in its second
year) there will also be presentations of 4 papers accepted recently
to the Journal of Functional Programming. Co-located symposia and
workshops will take place the day before and two days immediately
after the main conference.

Registration is now open. The early registration deadline is August
7th, 2021. Registration is not free, but is significantly lower than
usual, including a $10 discounted registration option available to
all. Students who are ACM or SIGPLAN members may register for FREE
before the early deadline.

https://regmaster.com/2021conf/ICFP21/register.php

New this year: Attendees will be able to sign-up for the ICFP
Mentoring Program (either to be a mentor, receive mentorship or both).


* Overview and affiliated events:
http://icfp21.sigplan.org/home

* Accepted papers:
http://icfp21.sigplan.org/track/icfp-2021-papers#event-overview

* JFP Talks:
https://icfp21.sigplan.org/track/icfp-2021-jfp-talks#event-overview

* Registration is available via:
https://regmaster.com/2021conf/ICFP21/register.php
Early registration ends 8 August, 2021.

* Programming contest:
https://icfpcontest2021.github.io/

* Student Research Competition:
https://icfp21.sigplan.org/track/icfp-2021-Student-Research-Competition

* Follow us on Twitter for the latest news:
http://twitter.com/icfp_conference

This year, there are 10 events co-located with ICFP:

* Erlang Workshop (8/26)
* Haskell Implementors' Workshop (8/22)
* Haskell Symposium (8/26-8/27)
* Higher-Order Programming with Effects (8/22)
* miniKanren Workshop (8/26)
* ML Family Workshop (8/26)
* OCaml Workshop (8/27)
* Programming Languages Mentoring Workshop (8/22)
* Scheme Workshop (8/27)
* Type-Driven Development (8/22)

### ICFP Organizers

General Chair: Sukyoung Ryu (KAIST, South Korea)
Program Chair: Ron Garcia (UBC, Canada)

Artifact Evaluation Co-Chairs: Brent Yorgey (Hendrix College, USA)
Gabriel Scherer (INRIA Saclay, France)
Industrial Relations Chair: Alan Jeffrey (Roblox, USA)
Simon Marlow (Facebook, UK)
Programming Contest Organizers: Alex Lang and Jasper Van der Jeugt
Publicity and Web Chair: Sam Tobin-Hochstadt (Indiana University, USA)
Student Research Competition Chair: Anders Miltner (University of Texas, USA)
Workshops Co-Chairs: Zoe Paraskevopoulou (Northeastern University, USA)
Leonidas Lampropoulos (University of Maryland, USA)
Video Co-Chairs: Leif Andersen (Northeastern University, USA)
Ben Chung (Northeastern University, USA)
Student Volunteer Co-Chairs: Hanneli Tavante (McGill University, Canada)
Jaemin Hong (KAIST, South Korea)
Lily Bryant (UBC, Canada)
Accessibility Co-Chairs: Lindsey Kuper (UCSC, USA)
Kathrin Stark (Princeton, USA)